A generalization of the binary preparata code
From MaRDI portal
Publication:2489929
Recommendations
- Publication:4332871
- On the decoding of Preparata codes
- On components of preparata codes
- Another generalisation of the binary Reed-Muller codes and its applications
- New binary codes from a generalization of Zinoviev's technique
- scientific article; zbMATH DE number 3485627
- A generalization of Lee codes
- Binary primitive alternant codes
- scientific article; zbMATH DE number 3930882
- scientific article; zbMATH DE number 493078
Cites work
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3435678 (Why is no real title available?)
- scientific article; zbMATH DE number 2077099 (Why is no real title available?)
- scientific article; zbMATH DE number 4185544 (Why is no real title available?)
- A class of low-rate nonlinear binary codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Two ``dual families of nearly-linear codes over \(\mathbb Z_p, p\) odd
Cited in
(6)- Generalized Preparata codes and 2-resolvable Steiner quadruple systems
- Representation of \(\mathbb Z_4\)-linear preparata codes using vector fields
- scientific article; zbMATH DE number 3859031 (Why is no real title available?)
- PN code generator based on generalized bent function for SW/SFH system
- Nonbinary Delsarte-Goethals codes and finite semifields
- Victor Timofeevich Markov (21.06.1948 -- 15.07.2019)
This page was built for publication: A generalization of the binary preparata code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489929)