Long BCH codes are bad

The BCH bound approaches zero with increasing code length for any fixed value of the ratio of minimum distance to code length. Does this happen because the codes actually deteriorate or does the bound just become loose? It is shown that the BCH bound gives the true minimum distance within a factor o...

Full description

Saved in:
Bibliographic Details
Published in:Information and control 1967-01, Vol.11 (4), p.445-451
Main Authors: Lin, Shu, Weldon, E.J.
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The BCH bound approaches zero with increasing code length for any fixed value of the ratio of minimum distance to code length. Does this happen because the codes actually deteriorate or does the bound just become loose? It is shown that the BCH bound gives the true minimum distance within a factor of two. We conclude that it is the codes, not the bound, which deteriorate with increasing code length.
ISSN:0019-9958
1878-2981
DOI:10.1016/S0019-9958(67)90660-2