Testing Sets for 1-Perfect Code
This paper continues the research of [1,2]. In  it was shown that a 1-perfect code is uniquely determined by its vertices at the middle levels of hypercube and in  the concerned formula was obtained. Now we prove that the vertices at the r-th level, r≤(n–1)/2, of such a code of length n uniquely determine all code vertices at the lower levels.
KeywordsOperation Research Block Code Middle Level Induction Supposition Common Vertex
Unable to display preview. Download preview PDF.