Partitions of F^n into non-parallel Hamming codes
From MaRDI portal
Publication:2268670
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
Cited in
(14)- The coding power of a product of partitions
- Construction of partitions of the set of all \(p\)-ary vectors of length \(p+1\) into Hamming codes
- A partition of the hypercube into maximally nonparallel Hamming codes
- On partitions of the q‐ary Hamming space into few spheres
- Partition designs with two subsets of the Hamming space
- On transitive uniform partitions of \(F^n\) into binary Hamming codes
- scientific article; zbMATH DE number 68348 (Why is no real title available?)
- Constructions of partitions of \(F_q^N\) into perfect \(q\)-ary codes
- Partitions into perfect codes in the Hamming and Lee metrics
- scientific article; zbMATH DE number 2239556 (Why is no real title available?)
- scientific article; zbMATH DE number 7656038 (Why is no real title available?)
- scientific article; zbMATH DE number 1882354 (Why is no real title available?)
- Intersection of Hamming codes avoiding Hamming subcodes
- On \(r\)-partition designs in Hamming spaces
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)
