Generalized Sudan's List Decoding for Order Domain Codes

@inproceedings{Geil2007GeneralizedSL,
  title={Generalized Sudan's List Decoding for Order Domain Codes},
  author={Olav Geil and Ryutaroh Matsumoto},
  booktitle={AAECC},
  year={2007}
}
We generalize Sudan’s list decoding algorithm without multiplicity to evaluation codes coming from arbitrary order domains. The number of correctable errors by the proposed method is larger than the original list decoding without multiplicity. 
BETA

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

Decoding Reed-Muller Codes with the GuruswamiSudan’s Algorithm. In: Slides of Talk Given by D

  • D. Augot, M. Stepanov
  • Augot at Workshop D1 Special Semester on Gröbner…
  • 2006
Highly Influential
8 Excerpts

Decoding ReedMuller Codes with the GuruswamiSudan ’ s Algorithm

  • D. Augot, M. Stepanov
  • Slides of Talk Given by D . Augot at Workshop D 1…
  • 2006

An Algorithm for Finding the Roots of the Polynomials Over Order Domains

  • Wu, X.-W.
  • IEEE International Symposium on Information…
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…