A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound | IEEE Journals & Magazine | IEEE Xplore