On a lower bound on the number of perfect binary codes

DOI10.1016/S0166-218X(02)00302-5zbMATH Open0930.94046OpenAlexW1976917113MaRDI QIDQ4936733FDOQ4936733

Sergey Artem'evich Malyugin

Publication date: 31 January 2000

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00302-5

Recommendations

• scientific article
• On enumeration of the perfect binary codes of length 15
• scientific article; zbMATH DE number 503208
• Structure of \(i\)-components of perfect binary codes
• Construction of perfect binary codes by sequential shifts of \(\tilde\alpha\)-components

zbMATH Keywords

lower bounddifferent perfect binary codesswitching of \(i\)-components

Mathematics Subject Classification ID

Combinatorial codes (94B25) Bounds on codes (94B65)

Cites Work

• Construction of perfect binary codes by sequential shifts of \(\tilde\alpha\)-components

Cited In (13)

• Title not available (Why is that?)
• A lower bound for 0,1,* tournament codes
• On enumeration of the perfect binary codes of length 15
• On components of preparata codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• On perfect binary codes
• On the binary codes with parameters of doubly-shortened 1-perfect codes
• The Algebraic Degree of Perfect Binary Codes
• Title not available (Why is that?)
• Upper bound for the number of perfect \((n,3)\)-codes
• Structure of \(i\)-components of perfect binary codes
• Bounds for binary codes of length less than 25

This page was built for publication: On a lower bound on the number of perfect binary codes

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