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. © 2009 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
APA
Beelen, P., & Brander, K. (2009). Decoding folded reed-solomon codes using hensel-lifting. In Gröbner Bases, Coding, and Cryptography (pp. 389–394). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-93806-4_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free