FGLM-Like Decoding: from Fitzpatrick’s Approach to Recent Developments

Eleonora Guerrini () and Anna Rimoldi ()
Additional contact information
Eleonora Guerrini: University of Trento, Department of Mathematics
Anna Rimoldi: University of Trento, Department of Mathematics

A chapter in Gröbner Bases, Coding, and Cryptography, 2009, pp 197-218 from Springer

Abstract: Abstract Many decoding problems in algebraic coding theory can be solved by the computation of a suitable Gröbner basis. The Gröbner basis can often be computed via the FGLM algorithm or a related algorithm (like the Buchberger–Möller algorithm). In this tutorial we describe how this has been done in the literature from a historical point of view, starting from Fitzpatrick’s seminal 1995 paper, and covering recent developments for list decoding.

Keywords: FGLM; Gröbner basis; Algebraic coding theory; Decoding; List decoding (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-93806-4_12

Ordering information: This item can be ordered from
http://www.springer.com/9783540938064

DOI: 10.1007/978-3-540-93806-4_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().