A General Product Construction for Error Correcting Codes

DOI10.1137/0605023zbMath0546.94015OpenAlexW2116611140MaRDI QIDQ3338100

Kevin T. Phelps

Publication date: 1984

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0605023

zbMATH Keywords

perfect codeHamming-metricbinary error correcting codesgeneralized product construction

Mathematics Subject Classification ID

Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)

Related Items (31)

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 ⋮ On the binary codes with parameters of doubly-shortened 1-perfect codes ⋮ Maximal partial packings of \(\mathbb Z_2^n\) with perfect codes ⋮ Kernels of nonlinear Hamming codes ⋮ On the number of \(q\)-ary quasi-perfect codes with covering radius 2 ⋮ Multidimensional Latin bitrades ⋮ Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+1\) over \(\mathbb F_2\) ⋮ Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes ⋮ On non-full-rank perfect codes over finite fields ⋮ Binary extended perfect codes of length 16 and rank 14 ⋮ Bussey systems and Steiner's tactical problem ⋮ Partitions into perfect codes in the Hamming and Lee metrics ⋮ On the number of nonequivalent propelinear extended perfect codes ⋮ On decomposability of 4-ary distance 2 MDS codes, double-codes, and \(n\)-quasigroups of order 4 ⋮ Linear maps of perfect codes and irregular \(C\)-partitions ⋮ On partitions of an \(n\)-cube into nonequivalent perfect codes ⋮ 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\) ⋮ The extended 1-perfect trades in small hypercubes ⋮ On kernels of perfect codes ⋮ On the size of the symmetry group of a perfect code ⋮ On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays ⋮ Perfect codes from the dual point of view. I ⋮ On transitive partitions of an \(n\)-cube into codes ⋮ On perfect \(p\)-ary codes of length \(p+1\) ⋮ Full rank perfect codes and \(\alpha \)-kernels ⋮ On switching equivalence of \(n\)-ary quasigroups of order 4 and perfect binary codes ⋮ On perfect and Reed-Muller codes over finite fields

Cites Work

• A Combinatorial Construction of Perfect Codes
• Direct Product of Derived Steiner Systems Using Inversive Planes
• New family of single-error correcting codes
• A Generalization of a Theorem due to MacNeish
• Orthogonal Arrays of Index Unity
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A General Product Construction for Error Correcting Codes