A Combinatorial Construction of Perfect Codes
From MaRDI portal
Publication:3342353
DOI10.1137/0604040zbMath0549.94029OpenAlexW1964584687MaRDI QIDQ3342353
Publication date: 1983
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0604040
Related Items (23)
A binary perfect code of length 15 and codimension 0 ⋮ Every finite group is the automorphism group of some perfect code ⋮ A Generalized Parity Function and Its Use in the Construction of Perfect Codes ⋮ Maximal partial packings of \(\mathbb Z_2^n\) with perfect codes ⋮ Kernels of nonlinear Hamming codes ⋮ On non-full-rank perfect codes over finite fields ⋮ An enumeration of 1-perfect ternary codes ⋮ Binary extended perfect codes of length 16 and rank 14 ⋮ Bussey systems and Steiner's tactical problem ⋮ On perfect codes in Cartesian products of graphs ⋮ Injective coloring of graphs revisited ⋮ Linear maps of perfect codes and irregular \(C\)-partitions ⋮ On perfect binary codes ⋮ A Partition of the Hypercube into Maximally Nonparallel Hamming Codes ⋮ Structure of Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+2\) over \(\mathbb F_2\) ⋮ Structure of \(i\)-components of perfect binary codes ⋮ A General Product Construction for Error Correcting Codes ⋮ Vasil'ev codes of length \(n=2^m\) and doubling of Steiner systems \(S(n,4,3)\) of a given rank ⋮ A concatenation construction for propelinear perfect codes from regular subgroups of \(\mathrm{GA}(r,2)\) ⋮ On perfect and Reed-Muller codes over finite fields ⋮ A new class of security oriented error correcting robust codes ⋮ Une nouvelle famille de 3-codes parfaits sur GF(q) ⋮ On enumeration of the perfect binary codes of length 15
Cites Work
This page was built for publication: A Combinatorial Construction of Perfect Codes
