Embedding in a perfect code
From MaRDI portal
Publication:3578151
DOI10.1002/JCD.20207zbMATH Open1197.94226arXiv0804.0006OpenAlexW3101365028MaRDI QIDQ3578151FDOQ3578151
Authors: Sergey Avgustinovich, Denis S. Krotov 
Publication date: 13 July 2010
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Abstract: A binary 1-error-correcting code can always be embedded in a 1-perfect code of some larger length
Full work available at URL: https://arxiv.org/abs/0804.0006
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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25)
Cites Work
- A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
- A survey of perfect codes
- Perfect binary codes: constructions, properties, and enumeration
- On perfect codes: Rank and kernel
- Kernels of nonlinear Hamming codes
- On perfect binary codes
- The completion of finite incomplete Steiner triple systems with applications to loop theory
- On the Number of $1$-Perfect Binary Codes: A Lower Bound
- Finite partial quadruple systems can be finitely embedded
- On the ranks and kernels problem for perfect codes
- On nonsystematic perfect binary codes.
- There exist Steiner triple systems of order 15 that do not occur in a perfect binary one‐error‐correcting code
- Nonsystematic perfect codes
Cited In (7)
- The extended 1-perfect trades in small hypercubes
- On full-rank perfect codes over finite fields
- On the embedding of constant-weight codes into perfect codes
- Title not available (Why is that?)
- On switching equivalence of \(n\)-ary quasigroups of order 4 and perfect binary codes
- 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
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)
