TR2004-097

Sparse Factor Graph Representations of Reed-Solomon and Related Codes


    •  Yedidia, J.S., "Sparse Factor Graph Representations of Reed-Solomon and Related Codes", IEEE International Symposium on Information Theory (ISIT), June 2004, pp. 260.
      BibTeX Download PDF
      • @inproceedings{Yedidia2004jun,
      • author = {Yedidia, J.S.},
      • title = {Sparse Factor Graph Representations of Reed-Solomon and Related Codes},
      • booktitle = {IEEE International Symposium on Information Theory (ISIT)},
      • year = 2004,
      • pages = 260,
      • month = jun,
      • url = {http://www.merl.com/publications/TR2004-097}
      • }
  • Research Area:

    Algorithms


We present sparse factor graph representations of Reed-Solomon codes based on a fast Fourier transform. These representations can be used to create encoders, or message-passing decoders that use soft input information. We discuss various simplications and transformations of the factor graph representations that may be useful. Finally, we show that other interesting codes can be represented using sparse fast transform factor graphs.