Coding Theory

Redundancy of Linear Codes with Orthogonal and $\lambda$-Connected Checks

V. S. Kugurakov


Abstract: Lower and upper bounds are derived for the minimum possible number of redundant symbols of linear (cyclic in particular) codes of length $n$ correcting one additive error by orthogonal and $\lambda$-connected checks. Some asymptotic results are also given

UDC: 621.391.15

Received: 04.02.1971

 English version: Problems of Information Transmission, 1972, 8:1, 25–32

Bibliographic databases:

• 
•