Oct 3, 2008 · In this work, our objective is to propose and investigate 2^m-ary codes with non-trivial binary trace codes as an alternative to RS codes.

Oct 3, 2008 · The main utility of SRS codes is that they are more amenable to efficient soft-decision decoding because of the. Page 2. 2 trace structure.

This work proposes and investigates subcodes of RS codes over GF that have a non-trivial binary trace with distances and rates meeting the derived bounds ...

The distance properties of RS codes result in excellent performance under hard-decision bounded-distance decoding. However, efficient and implementable soft ...

The distance properties of RS codes result in excellent performance under hard-decision bounded-distance decoding. In this work, we consider certain subcodes of ...

Andrew Thangaraj, Safitha J. Raj: Reed-Solomon Subcodes with Nontrivial Traces: Distance Properties and Soft-Decision Decoding. CoRR abs/0810.0567 (2008) ...

In this section, we discuss the construction and basic properties of sub Reed-. Solomon (SRS) codes with a nontrivial trace. We restrict ourselves to images of.

The Koetter-Vardy algorithm is an algebraic softdecision decoder for Reed-Solomon codes based on an extension to the Guruswami-Sudan list-decoding algorithm ...

Reed-Solomon (RS) codes over GF(2 m ) have traditionally been the most popular non-binary codes in almost all practical applications. The distance properties of ...

Reed-Solomon Subcodes with Nontrivial Traces: Distance Properties and Soft-Decision Decoding · pdf icon · hmtl icon · Published: 31 Dec 2007, Last Modified: 11 ...