More on the distance distribution of BCH codes

More on the distance distribution of BCH codes

We derive a new estimate for the error term in the binomial approximation to the distance distribution of BCH codes. This is an improvement on the earlier bounds by Kasami-Fujiwara-Lin (1985), Vladuts-Skorobogatov (1991), and Krasikov-Litsyn (1995).

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 1999-01, Vol.45 (1), p.251-255
Hauptverfasser: Keren, O., Litsyn, S.
Format: Artikel
Sprache:eng
Schlagworte:
Codes
Electrical engineering
Linear programming
Mathematical models
Mathematics
Polynomials
Upper bound
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We derive a new estimate for the error term in the binomial approximation to the distance distribution of BCH codes. This is an improvement on the earlier bounds by Kasami-Fujiwara-Lin (1985), Vladuts-Skorobogatov (1991), and Krasikov-Litsyn (1995).
ISSN:0018-9448
1557-9654
DOI:10.1109/18.746800