A Generalized Parity Function and Its Use in the Construction of Perfect Codes

DOI10.1137/0607013zbMath0585.94015MaRDI QIDQ3712238

Michel Mollard

Publication date: 1986

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0607013

zbMATH Keywords

product construction; single-error-correcting perfect codes

Mathematics Subject Classification ID

94B25: Combinatorial codes

05B40: Combinatorial aspects of packing and covering

Related Items

On perfect binary codes, Perfect codes in Doob graphs, On \(\mathbb Z_{4}\)-linear codes with the parameters of Reed-Muller codes, Transitive nonpropelinear perfect codes, Packing in honeycomb networks, On transitive partitions of an \(n\)-cube into codes, Full rank perfect codes and \(\alpha \)-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

Cites Work

• Unnamed Item
• A product construction for perfect codes over arbitrary alphabets (Corresp.)
• A General Product Construction for Error Correcting Codes
• A Combinatorial Construction of Perfect Codes
• Error Detecting and Error Correcting Codes
• On linear and nonlinear single-error-correcting q-nary perfect codes