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.
Fulltext:
PDF file (562 kB)