On diameter perfect constant-weight ternary codes
From MaRDI portal
Abstract: From cosets of binary Hamming codes we construct diameter perfect constant-weight ternary codes with weight (where is the code length) and distances 3 and 5. The class of distance 5 codes has parameters unknown before. Keywords: constant-weight codes, ternary codes, perfect codes, diameter perfect codes, perfect matchings, Preparata codes
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1522575 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- A bound on correlation immunity
- A class of optimum nonlinear double-error-correcting codes
- A class of perfect ternary constant-weight codes
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Codes, graphs, and schemes from nonlinear functions
- Inductive construction of perfect ternary constant-weight codes with distance 3
- On perfect codes and related concepts
- On perfect ternary constant weight codes
- On the Preparata and Goethals codes
- Representation of \(\mathbb Z_4\)-linear preparata codes using vector fields
- Ternary constant weight codes
Cited in
(8)- On a class of optimal constant weight ternary codes
- Inductive construction of perfect ternary constant-weight codes with distance 3
- On perfect ternary constant weight codes
- Representation of \(\mathbb Z_4\)-linear preparata codes using vector fields
- A family of diameter perfect constant-weight codes from Steiner systems
- Non-Binary Diameter Perfect Constant-Weight Codes
- Non-existence of a ternary constant weight \((16,5,15;2048)\) diameter perfect code
- A class of perfect ternary constant-weight codes
This page was built for publication: On diameter perfect constant-weight ternary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925005)