Partitions of F^n into non-parallel Hamming codes

DOI10.3934/AMC.2009.3.385zbMATH Open1191.94126OpenAlexW644192015MaRDI QIDQ2268670FDOQ2268670

Authors: Olof Heden, Faina I. Solov'eva 

Publication date: 8 March 2010

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2009.3.385

Recommendations

• On transitive uniform partitions of \(F^n\) into binary Hamming codes
• A partition of the hypercube into maximally nonparallel Hamming codes
• scientific article; zbMATH DE number 1882354
• Construction of partitions of the set of all \(p\)-ary vectors of length \(p+1\) into Hamming codes
• scientific article; zbMATH DE number 2239556

zbMATH Keywords

Hamming codeperfect codenon-parallel Hamming codesphelps partition

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25) Other types of codes (94B60)

Cited In (14)

• On transitive uniform partitions of \(F^n\) into binary Hamming codes
• Partitions into perfect codes in the Hamming and Lee metrics
• Title not available (Why is that?)
• Constructions of partitions of \(F_q^N\) into perfect \(q\)-ary codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Construction of partitions of the set of all \(p\)-ary vectors of length \(p+1\) into Hamming codes
• Partition designs with two subsets of the Hamming space
• The coding power of a product of partitions
• On \(r\)-partition designs in Hamming spaces
• On partitions of the q‐ary Hamming space into few spheres
• Intersection of Hamming codes avoiding Hamming subcodes
• A partition of the hypercube into maximally nonparallel Hamming codes

This page was built for publication: Partitions of \(\mathbb F^n\) into non-parallel Hamming codes

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