Embedding in a perfect code
Combinatorics
2016-05-03 v3 Information Theory
math.IT
Abstract
A binary 1-error-correcting code can always be embedded in a 1-perfect code of some larger length
Keywords
Cite
@article{arxiv.0804.0006,
title = {Embedding in a perfect code},
author = {Sergey Avgustinovich and Denis Krotov},
journal= {arXiv preprint arXiv:0804.0006},
year = {2016}
}
Comments
Eng: 5pp, Rus: 5pp. V3: revised, a survey added; the accepted version; Russian translation added