A class of low-rate nonlinear binary codes
From MaRDI portal
Publication:3214801
DOI10.1016/S0019-9958(72)90376-2zbMATH Open0271.94016OpenAlexW2073098064MaRDI QIDQ3214801FDOQ3214801
Authors: Anthony M. Kerdock
Publication date: 1972
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(72)90376-2
Cited In (45)
- An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions
- A general case of formal duality between binary nonlinear codes
- Sequences of bent functions and near-bent functions
- On the error-detecting performance of some classes of block codes
- Adventures in compressive sensing based MIMO radar
- The Automorphism Groups of the Kerdock Codes
- Nonbinary Delsarte-Goethals codes and finite semifields
- Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\)
- On groups with several doubly-transitive permutation representations
- New ring-linear codes from dualization in projective Hjelmslev geometries
- Symplectic spread-based generalized Kerdock codes
- Bilinear forms over a finite field, with applications to coding theory
- Binary linear codes from vectorial Boolean functions and their weight distribution
- Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\)
- A construction of binary linear codes from Boolean functions
- Algebraic theory of block codes detecting independent errors
- On the generalized concatenated construction for the Nordstrom-Robinson code and the binary Golay code
- Highly nonlinear mappings
- Alternating bilinear forms over GF(q)
- The connection between quadratic bent-negabent functions and the Kerdock code
- Jack van Lint (1932--2004): a survey of his scientific work
- Estimates of the neighborhood volumes of binary codes via their weight spectra
- Linear recurring sequences over rings and modules
- Complete weight enumerators of generalized Kerdock code and related linear codes over Galois ring
- Enumeration of Kerdock codes of length 64
- A generalization of the binary preparata code
- On components of the Kerdock codes and the dual of the BCH code \(C_{1, 3}\)
- On repeated-root multivariable codes over a finite chain ring
- Nonlinear diffusion layers
- Reed-Muller Codes
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
- A survey of constructive coding theory, and a table of binary codes of highest known rate
- On the Delsarte-Goethals codes and their formal duals
- Simplicity conditions for binary orthogonal arrays
- Multi-letter Youden rectangles from quadratic forms
- Title not available (Why is that?)
- \(\mathbb{Z}_ 4\)-linear codes obtained as projections of Kerdock and Delsarte-Goethals codes
- The automorphism groups of the Delsarte-Goethals codes
- Welch bound equality sets with few distinct inner products from Delsarte-Goethals sets
- A four-dimensional Kerdock set over GF(3)
- Spreads, Translation Planes and Kerdock Sets. I
- Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators
- A linear construction for certain Kerdock and Preparata codes
- Derivatives of bent functions in connection with the bent sum decomposition problem
- Symplectic semifield planes and ℤ₄–linear codes
This page was built for publication: A class of low-rate nonlinear binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3214801)