DUAL DISTANCE OF BCH CODES.

V. A. Zinov'ev*, S. N. Litsyn

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

An upper bound is derived on the dual distance of BCH binary codes. This yields an upper bound on the dual distance of the codes B(d, m). It also improves some lower bounds for complete rational trigonometric sums in fields of characteristic 2.

Original languageEnglish
Pages (from-to)272-277
Number of pages6
JournalProblems of Information Transmission
Volume22
Issue number4
StatePublished - Oct 1986

Fingerprint

Dive into the research topics of 'DUAL DISTANCE OF BCH CODES.'. Together they form a unique fingerprint.

Cite this