This article is cited in 5 papers

Coding Theory

Code-Generating Factorizations of the $n$-Dimensional Unit Cube and of Perfect Binary Codes

Yu. L. Vasil'ev, F. I. Solov'eva


Abstract: In the paper, an approach to constructing and studying perfect binary codes with distance 3 is introduced. This approach is to study their modifications, i.e., perfect codes with the same projection along a given coordinate, and is based on studying corresponding connection structures over an $n$-cube and their factorizations, which are called code-generating. Basic properties of the notions mentioned are presented. Examples of their application to the construction of rather extensive classes of perfect codes are given.

UDC: 621.391.15

Received: 01.08.1995
Revised: 14.05.1996

 English version: Problems of Information Transmission, 1997, 33:1, 53–61

Bibliographic databases:

• 
•