Structure of \(i\)-components of perfect binary codes

DOI10.1016/S0166-218X(00)00352-8zbMath1025.94024MaRDI QIDQ5939244

Faina I. Solov'eva

Publication date: 20 November 2003

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

Full work available at URL: https://eudml.org/doc/162280

zbMATH Keywords

perfect binary codescomponents

Mathematics Subject Classification ID

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

Related Items (6)

Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes ⋮ Tilings of nonorientable surfaces by Steiner triple systems ⋮ Switching codes and designs ⋮ On perfect binary codes ⋮ The extended 1-perfect trades in small hypercubes ⋮ Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Code-generating factorizations of an \(n\)-dimensional unit cube and of perfect binary codes
• Perfect binary codes: bounds and properties
• A Combinatorial Construction of Perfect Codes
• On binary cyclic codes of odd lengths from 101 to 127
• A new construction of group and nongroup perfect codes
• On the Nonexistence of Perfect Codes over Finite Fields

This page was built for publication: Structure of \(i\)-components of perfect binary codes