|
Problemy Peredachi Informatsii, 1986, Volume 22, Issue 4, Pages 29–34
(Mi ppi955)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Information Theory and Coding Theory
On the Dual Distance of BCH Codes
V. A. Zinov'ev, S. N. Litsyn
Abstract:
An upper bound is derived on the dual distance of BCH binary codes. This enables us to improve the lower bound on rational trigonometric sums in fields of characteristic 2.
Received: 30.10.1984 Revised: 12.03.1985
Citation:
V. A. Zinov'ev, S. N. Litsyn, “On the Dual Distance of BCH Codes”, Probl. Peredachi Inf., 22:4 (1986), 29–34; Problems Inform. Transmission, 22:4 (1986), 272–277
Linking options:
https://www.mathnet.ru/eng/ppi955 https://www.mathnet.ru/eng/ppi/v22/i4/p29
|
Statistics & downloads: |
Abstract page: | 268 | Full-text PDF : | 117 | First page: | 2 |
|