|
Problemy Peredachi Informatsii, 1984, Volume 20, Issue 3, Pages 17–23
(Mi ppi1139)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Coding Theory
New Binary Linear Codes
Zh. G. Margaryan, G. L. Movsisyan
Abstract:
New classes of binary linear codes are obtained; for some $n$ and $k$ values these classes improve the available lower bounds [H. J. Helgart and R. D. Stinaff, IEEE Trans. Inf. Theory, 1973, vol. 19, no. 3, pp. 344–356] for the function $d_{\max}(n,k)$. The weight spectra of these codes are described. Uniformly packed binary linear codes with minimum distance 4 are constructed.
Received: 17.05.1983
Citation:
Zh. G. Margaryan, G. L. Movsisyan, “New Binary Linear Codes”, Probl. Peredachi Inf., 20:3 (1984), 17–23; Problems Inform. Transmission, 20:3 (1984), 167–173
Linking options:
https://www.mathnet.ru/eng/ppi1139 https://www.mathnet.ru/eng/ppi/v20/i3/p17
|
Statistics & downloads: |
Abstract page: | 285 | Full-text PDF : | 122 |
|