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

From MaRDI portal

(Redirected from A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_low-complexity_algorithm_for_the_construction_of_algebraic-geometric_codes_better_than_the_Gilbert-Varshamov_bound&oldid=97194284"