\(\mathbb Z_{8}\)-Kerdock codes and pseudorandom binary sequences

DOI10.1016/j.jco.2003.08.014zbMath1059.94013MaRDI QIDQ1827572

Patrick Solé, Dmitrii Zinoviev, San Ling, Jyrki Lahtonen

Publication date: 6 August 2004

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2003.08.014

zbMATH Keywords

Boolean functions; Correlation; Nonlinearity; Generalized Kerdock code; Most significant bit map

Mathematics Subject Classification ID

94A55: Shift register sequences and sequences over finite alphabets in information and communication theory

94A60: Cryptography

94B60: Other types of codes

Related Items

Метод тригонометрических сумм для исследования частот $r$-грамм в старших координатных последовательностях линейных рекуррент над кольцом $\mathbb{Z}_{2^n}$, Параметры булевых функций, построенных с использованием старших координатных последовательностей линейных рекуррент, Galois Rings and Pseudo-random Sequences, Estimating the number of solutions of systems of nonlinear equations with linear recurring arguments by the spectral method, Equidistributed sequences over finite fields produced by one class of linear recurring sequences over residue rings, An invariant for quadratic forms valued in Galois rings of characteristic 4, Параметры одного класса функций, заданных на конечном поле, The Peak to Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings

Cites Work

• Unnamed Item
• Unnamed Item
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• An expansion for the coordinates of the trace function over Galois rings
• Z/sub 2/k-linear codes
• An upper bound for Weil exponential sums over Galois rings and applications
• On the odd and the aperiodic correlation properties of the Kasami sequences
• Improved binary codes and sequence families from Z/sub 4/-linear codes