pith. sign in

arxiv: 1212.5663 · v1 · pith:HUHOPL7Rnew · submitted 2012-12-22 · 💻 cs.IT · math.IT

On the decoding of quasi-BCH codes

Morgan Barbier (GREYC) , Cl\'ement Pernet (INRIA Grenoble Rh\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble) , Guillaume Quintin (LIX) This is my paper
classification 💻 cs.IT math.IT
keywords codesquasi-bchreed-solomondecodingpartadaptalgorithmallows
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.