Some results on the binary minimum distance of Reed-Solomon codes and block turbo codes

Raphaël Le Bidan (1) , Ramesh Pyndiah (2) , Patrick Adde (2)

1 SC - Département Signal et Communications
2 TAMCIC - Traitement Algorithmique et Matériel de la Communication, de l'Information et de la Connaissance

We study the minimum distance of the binary expansion of high-rate Reed-Solomon (RS) codes and product codes in the polynomial basis and show hat the binary codes obtained in this way usually have minimum distance equal to the designed symbol minimum distance. We then show that a judicious choice for the code roots may yield binary expansions with larger binary minimum distance and better asymptotic performance. This result is used to design high-rate RS product codes with significantly lower error floors compared to classical constructions.

Domaines: Traitement du signal et de l'image [eess.SP]

Raphaël Le Bidan, Ramesh Pyndiah, Patrick Adde. Some results on the binary minimum distance of Reed-Solomon codes and block turbo codes. ICC'07 : IEEE International conference on communications, Jun 2007, Glasgow, United Kingdom. pp.990 - 994, ⟨10.1109/ICC.2007.168⟩. ⟨hal-01876233⟩