Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On representations of algebraic-geometry codes

From MaRDI portal
Publication:4544598
Jump to:navigation, search

DOI10.1109/18.923745zbMath1002.94041OpenAlexW2111187182MaRDI QIDQ4544598

Madhu Sudan, Venkatesan Guruswami

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.923745


zbMATH Keywords

algebraic-geometric codespolynomial time algorithmalgebraic function fieldsroot-finding algorithmsuccinct representationlist decoding algorithms


Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)


Related Items (6)

Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes ⋮ Unnamed Item ⋮ Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes ⋮ On the Computation of Non-uniform Input for List Decoding on Bezerra-Garcia Tower ⋮ Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets ⋮ List decoding codes on Garcia-Stichtenoth tower using Gröbner basis




This page was built for publication: On representations of algebraic-geometry codes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4544598&oldid=18665571"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 11:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki