A Generalized Parity Function and Its Use in the Construction of Perfect Codes
From MaRDI portal
Recommendations
Cites work
- A Combinatorial Construction of Perfect Codes
- A General Product Construction for Error Correcting Codes
- A product construction for perfect codes over arbitrary alphabets (Corresp.)
- Error detecting and error correcting codes
- scientific article; zbMATH DE number 3178047 (Why is no real title available?)
- On linear and nonlinear single-error-correcting q-nary perfect codes
Cited in
(18)- Full rank perfect codes and -kernels
- On the Mollard code as a partially robust code
- The superstar packing problem
- Mollard code as a robust nonlinear code
- Coordinate transitivity of a class of extended perfect codes and their SQS
- A concatenation construction for propelinear perfect codes from regular subgroups of \(\mathrm{GA}(r,2)\)
- On transitive uniform partitions of \(F^n\) into binary Hamming codes
- On the symmetry group of the Mollard code
- On non-full-rank perfect codes over finite fields
- On the construction of transitive codes
- Perfect codes in Doob graphs
- A General Product Construction for Error Correcting Codes
- On \(\mathbb Z_{4}\)-linear codes with the parameters of Reed-Muller codes
- PN code generator based on generalized bent function for SW/SFH system
- Transitive nonpropelinear perfect codes
- On perfect binary codes
- Packing in honeycomb networks
- On transitive partitions of an \(n\)-cube into codes
This page was built for publication: A Generalized Parity Function and Its Use in the Construction of Perfect Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3712238)
