Abstract: A binary 1-error-correcting code can always be embedded in a 1-perfect code of some larger length
Recommendations
- Embedding in q-ary 1-perfect codes and partitions
- There exist Steiner triple systems of order 15 that do not occur in a perfect binary one‐error‐correcting code
- On the Steiner quadruple systems of small rank which are embeddable into extended perfect binary codes
- Perfect codes from the dual point of view. I
- scientific article; zbMATH DE number 6516526
Cites work
- A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
- A survey of perfect codes
- Finite partial quadruple systems can be finitely embedded
- Kernels of nonlinear Hamming codes
- Nonsystematic perfect codes
- On nonsystematic perfect binary codes.
- On perfect binary codes
- On perfect codes: Rank and kernel
- On the Number of 1-Perfect Binary Codes: A Lower Bound
- On the ranks and kernels problem for perfect codes
- Perfect binary codes: constructions, properties, and enumeration
- The completion of finite incomplete Steiner triple systems with applications to loop theory
- There exist Steiner triple systems of order 15 that do not occur in a perfect binary one‐error‐correcting code
Cited in
(9)- The extended 1-perfect trades in small hypercubes
- Embedding in q-ary 1-perfect codes and partitions
- Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes
- On full-rank perfect codes over finite fields
- On the embedding of constant-weight codes into perfect codes
- scientific article; zbMATH DE number 4211968 (Why is no real title available?)
- On the admissible families of components of Hamming codes
- Embedding in MDS codes and Latin cubes
- On switching equivalence of \(n\)-ary quasigroups of order 4 and perfect binary codes
This page was built for publication: Embedding in a perfect code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578151)
