Algebraische Decodierung von Reed-Solomon Codes über die halbe Mindestdistanz und dessen Anwendung

No abstract available

Publications

• Decoding of interleaved RS codes with the Euclidean algorithm. In Proc. IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 2008. IEEE
  M. Bossert and S. Bezzateev
  
• Decoding punctured Reed-Solomon codes up to the Singleton bound. In Proc. 7th International ITG Conference on Source and Channel Coding, Ulm, Germany, January 2008
  V. Sidorenko, G. Schmidt, and M. Bossert
  
• Collaborative decoding of interieaved reedsolomon codes and concatenated code designs. Information Theory, IEEE Transactions on, 55(7):2991-3012, 2009
  G. Schmidt, V. R. Sidorenko, and M. Bossert
  
• Multi-trial decoding of concatenated codes using fixed thresholds. Problems of Information Transmission, 46(2):127-14l, 2010
  Ch. Senger, V. R. Sidorenko, M. Bossert, and V. V. Zyablov
  
• Optimal thresholds for GMD decoding with l+1/l-extended bounded distance decoders. In Proc. IEEE International Symposium on Information Theory, pages 1100-1104, Austin, TX, USA, June 2010
  Ch. Senger, V. R. Sidorenko, M. Bossert, and V. V. Zyablov
  
• Syndrome decoding of reedsolomon codes beyond half the minimum distance based on shift-register synthesis. IEEE Transactions on Information Theory, 56(IO):5245-5252, October 2010
  Georg Schmidt, Vladimir R. Sidorenko, and Martin Bossert