Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction

DOI10.1016/J.FFA.2005.10.002zbMATH Open1140.94019OpenAlexW2059293724MaRDI QIDQ2467321FDOQ2467321

Mingsheng Wang

Publication date: 21 January 2008

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2005.10.002

zbMATH Keywords

finite fieldsReed-Solomon codespolynomial reconstruction

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65) Polynomials, factorization in commutative rings (13P05) Decoding (94B35)

Cites Work

• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Decoding of Reed Solomon codes beyond the error-correction bound
• Modern computer algebra
• Limits to list decoding Reed-Solomon codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes

This page was built for publication: Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467321)