A class of low-rate nonlinear binary codes
From MaRDI portal
Publication:3214801
DOI10.1016/S0019-9958(72)90376-2zbMath0271.94016MaRDI QIDQ3214801
Publication date: 1972
Published in: Information and Control (Search for Journal in Brave)
94B99: Theory of error-correcting codes and error-detecting codes
Related Items
A linear construction for certain Kerdock and Preparata codes, Symplectic semifield planes and ℤ₄–linear codes, Complete weight enumerators of generalized Kerdock code and related linear codes over Galois ring, A general case of formal duality between binary nonlinear codes, Jack van Lint (1932--2004): a survey of his scientific work, On the Delsarte-Goethals codes and their formal duals, Algebraic theory of block codes detecting independent errors, Alternating bilinear forms over GF(q), A four-dimensional Kerdock set over GF(3), Bilinear forms over a finite field, with applications to coding theory, The automorphism groups of the Delsarte-Goethals codes, Multi-letter Youden rectangles from quadratic forms, Highly nonlinear mappings, An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions, \(\mathbb{Z}_ 4\)-linear codes obtained as projections of Kerdock and Delsarte-Goethals codes, Linear recurring sequences over rings and modules, Symplectic spread-based generalized Kerdock codes, A generalization of the binary preparata code, On groups with several doubly-transitive permutation representations, A survey of constructive coding theory, and a table of binary codes of highest known rate, On the error-detecting performance of some classes of block codes, Spreads, Translation Planes and Kerdock Sets. I, The Automorphism Groups of the Kerdock Codes
