A binary perfect code of length 15 and codimension 0

DOI10.1007/BF01388453MaRDI QIDQ1329112zbMATH OpenFDO

Authors Olof Heden

Publication date 15 December 1994

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01388453

zbMATH Keywords

error correcting codenonlinear binary codesperfect codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Recommendations

• Perfect Codes of Length n with Kernels of Dimension $n-\log(n+1)-3$
• scientific article; zbMATH DE number 1811357
• Affine 3-nonsystematic perfect codes of length 15
• On perfect codes: Rank and kernel
• scientific article; zbMATH DE number 1811359

Cites work

• A Combinatorial Construction of Perfect Codes
• A General Product Construction for Error Correcting Codes
• A new construction of group and nongroup perfect codes
• An algebraic study of group and nongroup error-correcting codes
• scientific article; zbMATH DE number 3856997 (Why is no real title available?)
• scientific article; zbMATH DE number 3926802 (Why is no real title available?)

Cited in

(6)

• Full rank perfect codes and -kernels
• Kernels of nonlinear Hamming codes
• On enumeration of the perfect binary codes of length 15
• On nonsystematic perfect binary codes of length 15
• On perfect binary codes
• Binary perfect and extended perfect codes of lengths 15 and 16 and of ranks 13 and 14

This page was built for publication: A binary perfect code of length 15 and codimension 0

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329112)