Constructions of partitions of F_q^N into perfect q-ary codes
From MaRDI portal
Publication:3115181
zbMATH Open1249.94063MaRDI QIDQ3115181FDOQ3115181
Authors: A. V. Los', Faina I. Solov'eva 
Publication date: 20 February 2012
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
perfect \(q\)-ary codelower bound on the number of different partitionspartition of a vector space into codes
Cited In (13)
- Partitions into perfect codes in the Hamming and Lee metrics
- Title not available (Why is that?)
- On construction of vertex-transitive partitions of the \(n\)-cube into perfect codes
- On partitions of an \(n\)-cube into nonequivalent perfect 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
- On the Kronecker Product Construction of Completely Transitive q-Ary Codes
- Construction of perfect \(q\)-ary codes by switchings of simple components
- Embedding in \(q\)-ary 1-perfect codes and partitions
- On Application of the Partition Distance Concept to a Comparative Analysis of Psychological or Sociological Tests
- Linear maps of perfect codes and irregular \(C\)-partitions
- On partitions of an \(n\)-cube into perfect binary codes
- Title not available (Why is that?)
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)
