A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound.

Kenneth W. Shum Ilia Aleshnikov P. Vijay Kumar Henning Stichtenoth Vinay Deolalikar A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound. 2225-2241 2001 47 IEEE Transactions on Information Theory 6 db/journals/tit/tit47.html#ShumAKSD01