Power Decoding of Reed-Solomon Codes Revisited

@inproceedings{Nielsen2014PowerDO,
  title={Power Decoding of Reed-Solomon Codes Revisited},
  author={J. S. R. Nielsen},
  booktitle={ICMCTA},
  year={2014}
}
  • J. S. R. Nielsen
  • Published in ICMCTA 2014
  • Computer Science, Mathematics
  • Power decoding, or “decoding by virtual interleaving”, of Reed–Solomon codes is a method for unique decoding beyond half the minimum distance. We give a new variant of the Power decoding scheme, building upon the key equation of Gao. We show various interesting properties such as behavioural equivalence to the classical scheme using syndromes, as well as a new bound on the failure probability when the powering degree is 3. 
    5 Citations
    Power Decoding Reed-Solomon Codes Up to the Johnson Radius
    • 17
    • PDF
    Decoding of interleaved Reed-Solomon codes using improved power decoding
    • 16
    • PDF
    Power decoding Reed-Solomon codes up to the Johnson radius
    • 5
    Power error locating pairs
    Sub-Quadratic Decoding of One-Point Hermitian Codes
    • 11
    • PDF

    References

    SHOWING 1-10 OF 18 REFERENCES
    Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis
    • 51
    • PDF
    A New Algorithm for Decoding Reed-Solomon Codes
    • 124
    • PDF
    List Decoding of Algebraic Codes
    • 17
    • PDF
    Decoding of Reed Solomon Codes beyond the Error-Correction Bound
    • M. Sudan
    • Mathematics, Computer Science
    • J. Complex.
    • 1997
    • 728
    • PDF
    Fast skew-feedback shift-register synthesis
    • 23
    Generalised Multi-sequence Shift-Register synthesis using module minimisation
    • J. S. R. Nielsen
    • Computer Science, Mathematics
    • 2013 IEEE International Symposium on Information Theory
    • 2013
    • 21
    • PDF
    A linear algebraic approach to multisequence shift-register synthesis
    • 17
    Introduction to Coding Theory
    • 479
    • PDF
    On lattice reduction for polynomial matrices
    • T. Muldersa, A. Storjohannb
    • 2003
    • 49
    • PDF