Full rank perfect codes and \(\alpha \)-kernels

DOI10.1016/j.disc.2008.04.051zbMath1171.94010OpenAlexW2016928832MaRDI QIDQ1025476

Olof Heden

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.051

zbMATH Keywords

perfect codessimplex codesfull rank perfect codesnormal \(\alpha\)-codessuperdual of perfect code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60) Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On nonsystematic perfect binary codes.
• Construction of perfect binary codes by sequential shifts of \(\tilde\alpha\)-components
• A binary perfect code of length 15 and codimension 0
• On the reconstruction of perfect codes
• On perfect codes: Rank and kernel
• On the ranks and kernels problem for perfect codes
• The partial order of perfect codes associated to a perfect code
• A full rank perfect code of length 31
• A remark on full rank perfect codes
• On enumeration of the perfect binary codes of length 15
• A General Product Construction for Error Correcting Codes
• A Generalized Parity Function and Its Use in the Construction of Perfect Codes
• On Perfect Codes and Tilings: Problems and Solutions
• Error Detecting and Error Correcting Codes
• Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces
• Tilings of Binary Spaces