On the decoding of quasi-BCH codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

On the decoding of quasi-BCH codes

Abstract

In this paper we investigate the structure of quasi-BCH codes. In the first part of this paper we show that quasi-BCH codes can be derived from Reed-Solomon codes over square matrices extending the known relation about classical BCH and Reed-Solomon codes. This allows us to adapt the Welch-Berlekamp algorithm to quasi-BCH codes. In the second part of this paper we show that quasi-BCH codes can be seen as subcodes of interleaved Reed-Solomon codes over finite fields. This provides another approach for decoding quasi-BCH codes.
Fichier principal
Vignette du fichier
article.pdf (148.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00768566 , version 1 (21-12-2012)

Identifiers

Cite

Morgan Barbier, Clément Pernet, Guillaume Quintin. On the decoding of quasi-BCH codes. WCC - International Workshop on Coding and Cryptography, Apr 2013, Bergen, Norway. ⟨hal-00768566⟩
424 View
139 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More