Constructions of partitions of F_q^N into perfect q-ary codes
From MaRDI portal
Publication:3115181
Recommendations
- On the partition of the space F_q^N into affine-nonequivalent perfect q-ary codes
- Construction of partitions of the set of all \(p\)-ary vectors of length \(p+1\) into Hamming codes
- On partitions of an n-cube into nonequivalent perfect codes
- Partitions of \(\mathbb F^n\) into non-parallel Hamming codes
- scientific article; zbMATH DE number 2239556
Cited in
(13)- On partitions of an \(n\)-cube into perfect binary codes
- On the Kronecker Product Construction of Completely Transitive q-Ary Codes
- Construction of partitions of the set of all \(p\)-ary vectors of length \(p+1\) into Hamming codes
- On the partition of the space \(F_q^N\) into affine-nonequivalent perfect \(q\)-ary codes
- Construction of perfect \(q\)-ary codes by switchings of simple components
- Partitions into perfect codes in the Hamming and Lee metrics
- On construction of vertex-transitive partitions of the \(n\)-cube into perfect codes
- scientific article; zbMATH DE number 2239556 (Why is no real title available?)
- Linear maps of perfect codes and irregular \(C\)-partitions
- Embedding in \(q\)-ary 1-perfect codes and partitions
- On partitions of an \(n\)-cube into nonequivalent perfect codes
- On Application of the Partition Distance Concept to a Comparative Analysis of Psychological or Sociological Tests
- scientific article; zbMATH DE number 2154100 (Why is no real title available?)
This page was built for publication: Constructions of partitions of \(F_q^N\) into perfect \(q\)-ary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115181)
