Every binary (2/sup m/-2, 2/sup 2(m)-2-m/, 3) code can be lengthened to form a perfect code of length 2/sup m/-1

DOI10.1109/18.749014zbMath0946.94029OpenAlexW2080932079MaRDI QIDQ4701314

Tim Blackmore

Publication date: 21 November 1999

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

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

zbMATH Keywords

perfect codelengthened code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60)

Related Items (3)

On the binary codes with parameters of doubly-shortened 1-perfect codes ⋮ Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes ⋮ On the binary codes with parameters of triply-shortened 1-perfect codes

This page was built for publication: Every binary (2/sup m/-2, 2/sup 2(m)-2-m/, 3) code can be lengthened to form a perfect code of length 2/sup m/-1