This article is cited in 3 papers

Information Theory and Coding Theory

Characterization of Two Classes of Codes that Attain the Griesmer Bound

S. M. Dodunekov, N. L. Manev


Abstract: Linear binary codes are considered. It is shown that, to within isomorphism, there exists a unique code with parameters [$2^k-2^{k-i}-3$, $k$, $2^{k-1}-2^{k-i-1}-2$], $2\leq i\leq k-4$, and two nonisomorphic codes with parameters [$2^k-11$, $k$, $2^{k-1}-6$], $k\geq 5$.

UDC: 519.72:621.391.15

Received: 04.05.1982

 English version: Problems of Information Transmission, 1983, 19:4, 253–259

Bibliographic databases:

• 
•