Z8-Kerdock codes and pseudorandom binary sequences
The Z8 -analogues of the Kerdock codes of length n=2m were introduced by Carlet in 1998. We study the binary sequences of period n - 1 obtained from their cyclic version by using the most significant bit (MSB)-map.The relevant Boolean functions are of degree 4 in general. The linear span of t...
Main Authors: | Lahtonen, Jyrki, Ling, San, Sole, Patrick, Zinoviev, Dmitrii |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Journal Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/98360 http://hdl.handle.net/10220/9844 |
Similar Items
-
Product Construction of Affine Codes
by: Chee, Yeow Meng, et al.
Published: (2015) -
CSS-like constructions of asymmetric quantum codes
by: Ezerman, Martianus Frederic, et al.
Published: (2019) -
On linear complementary pairs of codes
by: Solé, Patrick, et al.
Published: (2019) -
On the generalised rank weights of quasi-cyclic codes
by: Lim, Enhui, et al.
Published: (2022) -
Redundantly grouped cross-object coding for repairable storage
by: Datta, Anwitaman, et al.
Published: (2012)