|
Problemy Peredachi Informatsii, 1998, Volume 34, Issue 3, Pages 37–46
(Mi ppi415)
|
|
|
|
Coding Theory
Minimal Codewords of the Primitive BCH Codes
Yu. F. Borisov, N. L. Manev
Abstract:
The numbers of minimal (nonminimal) codewords of weights 10 and 11 in a binary double-error-correcting primitive $[n=2^m-1, n-2m,5]$ BCH code and those of weight 12 in its extended code are found.
Received: 13.01.1997 Revised: 21.01.1998
Citation:
Yu. F. Borisov, N. L. Manev, “Minimal Codewords of the Primitive BCH Codes”, Probl. Peredachi Inf., 34:3 (1998), 37–46; Problems Inform. Transmission, 34:3 (1998), 238–246
Linking options:
https://www.mathnet.ru/eng/ppi415 https://www.mathnet.ru/eng/ppi/v34/i3/p37
|
Statistics & downloads: |
Abstract page: | 406 | Full-text PDF : | 248 | References: | 42 |
|