Please use this identifier to cite or link to this item:
Title: Z8-Kerdock codes and pseudorandom binary sequences
Authors: Lahtonen, Jyrki
Ling, San
Sole, Patrick
Zinoviev, Dmitrii
Keywords: DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory
Issue Date: 2003
Source: Lahtonen, J., Ling, S., Solé, P., & Zinoviev, D. (2003). Z8-Kerdock codes and pseudorandom binary sequences. Journal of Complexity, 20(2-3), 318-330.
Series/Report no.: Journal of complexity
Abstract: 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 these sequences has been known to be of the order of m4. We will show that the crosscorrelation and nontrivial autocorrelation of this family are both upper bounded by a small multiple of v4. The nonlinearity of these sequences has a similar lower bound. A generalization of the above results to the alphabet Z2l, l >= 4 is sketched out.
ISSN: 0885064X
Rights: © 2003 Elsevier Inc. This is the author created version of a work that has been peer reviewed and accepted for publication by Journal of Complexity, Elsevier Inc. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [].
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Journal Articles

Files in This Item:
File Description SizeFormat 
40. Z8-Kerdock codes and pseudorandom binary sequences.pdf304.38 kBAdobe PDFThumbnail

Google ScholarTM



Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.