On construction of vertex-transitive partitions of the n-cube into perfect codes

MaRDI QIDQ3115222zbMATH OpenFDO

Authors G. K. Guskov, Faina I. Solov'eva

Publication date 20 February 2012

zbMATH Keywords

\(k\)-transitive partition of \(n\)-cubeperfect binary codevertex-transitive partition

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Recommendations

• On transitive partitions of an \(n\)-cube into codes
• On partitions of an n-cube into nonequivalent perfect codes
• On partitions of an n-cube into perfect binary codes
• On the construction of transitive codes
• Constructions of partitions of F_q^N into perfect q-ary codes

Cited in

(7)

• On transitive uniform partitions of \(F^n\) into binary Hamming codes
• On the construction of transitive codes
• On perfect 2-colorings of the q-ary n-cube
• On partitions of an n-cube into perfect binary codes
• On transitive partitions of an \(n\)-cube into codes
• Symmetric vertex partitions of hypercubes by isometric trees
• On partitions of an n-cube into nonequivalent perfect codes

This page was built for publication: On construction of vertex-transitive partitions of the \(n\)-cube into perfect codes

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