|
Problemy Peredachi Informatsii, 1989, Volume 25, Issue 1, Pages 100–103
(Mi ppi643)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Сorrespondence
he Dimension of BCH Codes
I. E. Shparlinski
Abstract:
We derive an upper bound on the number of information symbols of arbitrary $q$-ary BCH codes with a given constructive distance $d$ and length $n$. A similar result has been previously available only for codes of length $n=q^{m-1}$, $m=1,2,\dots$.
Received: 31.10.1986
Citation:
I. E. Shparlinski, “he Dimension of BCH Codes”, Probl. Peredachi Inf., 25:1 (1989), 100–103; Problems Inform. Transmission, 25:1 (1989), 77–80
Linking options:
https://www.mathnet.ru/eng/ppi643 https://www.mathnet.ru/eng/ppi/v25/i1/p100
|
Statistics & downloads: |
Abstract page: | 240 | Full-text PDF : | 93 |
|