Decoding Folded Reed–Solomon Codes Using Hensel-Lifting

Peter Beelen () and Kristian Brander ()
Additional contact information
Peter Beelen: Technical University of Denmark, DTU Mathematics
Kristian Brander: Technical University of Denmark, DTU Mathematics

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

Abstract: Abstract A standard problem in coding theory is to construct good codes together with an efficient decoder. This paper addresses the construction of a class of codes (folded RS codes) for which one can give an efficient and (in a certain sense) optimal decoder, by adapting a list decoding algorithm.

Keywords: Interpolation Polynomial; Code Word; Primitive Element; Weighted Degree; Good Code (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_26

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

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

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 ().