The Algebraic Degree of Perfect Binary Codes

DOI10.1109/TIT.2008.929971MaRDI QIDQ3604851zbMATH OpenOpenAlexFDO

Authors Dan Popescu

Publication date 24 February 2009

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

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

zbMATH Keywords

Affine invariantalgebraic degreealgebraic normal formleading formperfect binary code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• scientific article; zbMATH DE number 850320
• On a property of perfect binary codes
• Perfect binary codes: bounds and properties
• Perfect binary codes: constructions, properties, and enumeration
• On perfect binary codes
• On a lower bound on the number of perfect binary codes
• scientific article; zbMATH DE number 503208
• On perfect arithmetic codes
• The classification of some perfect codes
• A note on perfect arithmetic codes (Corresp.)

Cited in

(3)

• On encoding symbol degrees of array BP-XOR codes
• scientific article; zbMATH DE number 850320 (Why is no real title available?)
• Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators

This page was built for publication: The Algebraic Degree of Perfect Binary Codes

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