On partitions of an n-cube into perfect binary codes

MaRDI QIDQ5263808zbMATH OpenFDO

Authors G. K. Guskov

Publication date 17 July 2015

Full work available at URL http://mathnet.ru/eng/da723

zbMATH Keywords

perfect binary codelower bound on the number of partitionspartition of an n-cuberank of partition into perfect codes

Mathematics Subject Classification ID

Arithmetic codes (94B40)

Recommendations

• On partitions of an n-cube into nonequivalent perfect codes
• On transitive partitions of an \(n\)-cube into codes
• On construction of vertex-transitive partitions of the \(n\)-cube into perfect codes
• A partition of the hypercube into maximally nonparallel Hamming codes
• Constructions of partitions of \(F_q^N\) into perfect \(q\)-ary codes

Cited in

(10)

• Partitions into perfect codes in the Hamming and Lee metrics
• On construction of vertex-transitive partitions of the \(n\)-cube into perfect codes
• On transitive partitions of an \(n\)-cube into codes
• On partitions of an n-cube into nonequivalent perfect codes
• Numerical characterisation of n-cube subset partitioning
• Embedding in q-ary 1-perfect codes and partitions
• A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube
• The existence of perfect codes in a family of generalized Fibonacci cubes
• scientific article; zbMATH DE number 2154100 (Why is no real title available?)
• A partition of the hypercube into maximally nonparallel Hamming codes

This page was built for publication: On partitions of an \(n\)-cube into perfect binary codes

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