On transitive uniform partitions of \(F^n\) into binary Hamming codes

DOI10.33048/semi.2019.16.058zbMath1472.94086arXiv1904.01282OpenAlexW3016177350MaRDI QIDQ2323137

Faina I. Solov'eva

Publication date: 30 August 2019

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.01282

zbMATH Keywords

partitionHamming codeReed-Muller codedual code2-transitive partitiontransitive partitionuniform partition into Hamming codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• On a hypercube coloring problem
• On transitive partitions of an \(n\)-cube into codes
• Partitions of \(\mathbb F^n\) into non-parallel Hamming codes
• A Generalized Parity Function and Its Use in the Construction of Perfect Codes
• On Perfect Codes and Tilings: Problems and Solutions
• A Partition of the Hypercube into Maximally Nonparallel Hamming Codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On transitive uniform partitions of \(F^n\) into binary Hamming codes