RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 1986 Volume 22, Issue 4, Pages 29–34 (Mi ppi955)
This article is cited 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.

UDC: 621.391.1

Received: 30.10.1984
Revised: 12.03.1985


 English version: Problems of Information Transmission, 1986, 22:4, 272–277

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024