Skip to Main content Skip to Navigation
Conference papers

On the decoding of quasi-BCH codes

Morgan Barbier 1 Clément Pernet 2 Guillaume Quintin 3
1 Equipe AMACC - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
2 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
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.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-00768566
Contributor : Morgan Barbier <>
Submitted on : Friday, December 21, 2012 - 10:00:51 PM
Last modification on : Tuesday, February 9, 2021 - 3:24:24 PM
Long-term archiving on: : Sunday, December 18, 2016 - 10:00:59 AM

Files

article.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00768566, version 1
  • ARXIV : 1212.5663

Citation

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⟩

Share

Metrics

Record views

782

Files downloads

316