Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance
Sergey Yekhanin, Ilya I. Dumer · IEEE Transactions on Information Theory · 2004
Let A(q,n,d) denote the maximum size of a q-ary code of length n and distance d. We study the minimum asymptotic redundancy as n grows while q and d are fixed. For any d and q/spl ges/d-1, long algebraic codes are designed that improve on the Bose-Chaudhuri-Hocquenghem (BCH) codes and have the lowest asymptotic redundancy known to date. Prior to this work, codes of fixed distance that asymptotically surpass BCH codes and the Gilbert-Varshamov bound were designed only for distances 4,5, and 6.