Abstract:
By using the more general class of BCH codes, rather than RS codes as originally proposed, the results of Justesen [1] are improved for code rates below 0.07. The value o...Show MoreMetadata
Abstract:
By using the more general class of BCH codes, rather than RS codes as originally proposed, the results of Justesen [1] are improved for code rates below 0.07. The value ofd/nfor the new codes approaches the Varsharmov-Gilbert hound (0.5) as the rate approaches zero.
Published in: IEEE Transactions on Information Theory ( Volume: 19, Issue: 5, September 1973)