A product construction for perfect codes over arbitrary alphabets (Corresp.)

DOI10.1109/TIT.1984.1056963zbMath0557.94012OpenAlexW2054563306MaRDI QIDQ3221879

Kevin T. Phelps

Publication date: 1984

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1984.1056963

zbMATH Keywords

perfect codessingle-error-correcting codes

Mathematics Subject Classification ID

Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

A Generalized Parity Function and Its Use in the Construction of Perfect Codes ⋮ Perfect codes in Doob graphs ⋮ On non-full-rank perfect codes over finite fields ⋮ Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph

This page was built for publication: A product construction for perfect codes over arbitrary alphabets (Corresp.)