Edge coloring and stopping sets analysis in product codes with MDS components

Fanny Jardel, Joseph Boutros

Research output: Contribution to journalArticle

Abstract

We consider non-binary product codes with MDS components and their iterative row-column algebraic decoding on the erasure channel. Both independent and block erasures are considered in this paper. A compact graph representation is introduced on which we define double-diversity edge colorings via the rootcheck concept. An upper bound of the number of decoding iterations is given as a function of the graph size and the color palette size M. Then, we propose a differential evolution edge coloring algorithm that produces colorings with a large population of minimal rootcheck order symbols. The complexity of this algorithm per iteration is o(M) , for a given differential evolution parameter, where M itself is small with respect to the huge cardinality of the coloring ensemble. Stopping sets of a product code are defined in the context of MDS components and a relationship is established with the graph representation. A full characterization of these stopping sets is given up to a size (d+1)2, where d is the minimum Hamming distance of the MDS component code. The performance of MDS-based product codes with and without double-diversity coloring is analyzed in presence of both the block and the independent erasures. In the latter case, ML and iterative decoding are proven to coincide at small channel erasure probability. Furthermore, numerical results show excellent performance in presence of unequal erasure probability due to double-diversity colorings.

Original languageEnglish
Article number7819551
Pages (from-to)1439-1462
Number of pages24
JournalIEEE Transactions on Information Theory
Volume63
Issue number3
DOIs
Publication statusPublished - 1 Mar 2017

Fingerprint

Coloring
performance
Decoding
symbol
Hamming distance
Iterative decoding
Color

Keywords

  • Codes on graphs
  • Differential evolution
  • Distributed storage
  • Diversity
  • Edge coloring
  • Erasure channel
  • Iterative decoding
  • MDS codes
  • Product codes
  • Stopping sets

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Edge coloring and stopping sets analysis in product codes with MDS components. / Jardel, Fanny; Boutros, Joseph.

In: IEEE Transactions on Information Theory, Vol. 63, No. 3, 7819551, 01.03.2017, p. 1439-1462.

Research output: Contribution to journalArticle

@article{2c494c572fd7480e872c1ebf0536ce29,
title = "Edge coloring and stopping sets analysis in product codes with MDS components",
abstract = "We consider non-binary product codes with MDS components and their iterative row-column algebraic decoding on the erasure channel. Both independent and block erasures are considered in this paper. A compact graph representation is introduced on which we define double-diversity edge colorings via the rootcheck concept. An upper bound of the number of decoding iterations is given as a function of the graph size and the color palette size M. Then, we propose a differential evolution edge coloring algorithm that produces colorings with a large population of minimal rootcheck order symbols. The complexity of this algorithm per iteration is o(M) , for a given differential evolution parameter, where M itself is small with respect to the huge cardinality of the coloring ensemble. Stopping sets of a product code are defined in the context of MDS components and a relationship is established with the graph representation. A full characterization of these stopping sets is given up to a size (d+1)2, where d is the minimum Hamming distance of the MDS component code. The performance of MDS-based product codes with and without double-diversity coloring is analyzed in presence of both the block and the independent erasures. In the latter case, ML and iterative decoding are proven to coincide at small channel erasure probability. Furthermore, numerical results show excellent performance in presence of unequal erasure probability due to double-diversity colorings.",
keywords = "Codes on graphs, Differential evolution, Distributed storage, Diversity, Edge coloring, Erasure channel, Iterative decoding, MDS codes, Product codes, Stopping sets",
author = "Fanny Jardel and Joseph Boutros",
year = "2017",
month = "3",
day = "1",
doi = "10.1109/TIT.2017.2653806",
language = "English",
volume = "63",
pages = "1439--1462",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Edge coloring and stopping sets analysis in product codes with MDS components

AU - Jardel, Fanny

AU - Boutros, Joseph

PY - 2017/3/1

Y1 - 2017/3/1

N2 - We consider non-binary product codes with MDS components and their iterative row-column algebraic decoding on the erasure channel. Both independent and block erasures are considered in this paper. A compact graph representation is introduced on which we define double-diversity edge colorings via the rootcheck concept. An upper bound of the number of decoding iterations is given as a function of the graph size and the color palette size M. Then, we propose a differential evolution edge coloring algorithm that produces colorings with a large population of minimal rootcheck order symbols. The complexity of this algorithm per iteration is o(M) , for a given differential evolution parameter, where M itself is small with respect to the huge cardinality of the coloring ensemble. Stopping sets of a product code are defined in the context of MDS components and a relationship is established with the graph representation. A full characterization of these stopping sets is given up to a size (d+1)2, where d is the minimum Hamming distance of the MDS component code. The performance of MDS-based product codes with and without double-diversity coloring is analyzed in presence of both the block and the independent erasures. In the latter case, ML and iterative decoding are proven to coincide at small channel erasure probability. Furthermore, numerical results show excellent performance in presence of unequal erasure probability due to double-diversity colorings.

AB - We consider non-binary product codes with MDS components and their iterative row-column algebraic decoding on the erasure channel. Both independent and block erasures are considered in this paper. A compact graph representation is introduced on which we define double-diversity edge colorings via the rootcheck concept. An upper bound of the number of decoding iterations is given as a function of the graph size and the color palette size M. Then, we propose a differential evolution edge coloring algorithm that produces colorings with a large population of minimal rootcheck order symbols. The complexity of this algorithm per iteration is o(M) , for a given differential evolution parameter, where M itself is small with respect to the huge cardinality of the coloring ensemble. Stopping sets of a product code are defined in the context of MDS components and a relationship is established with the graph representation. A full characterization of these stopping sets is given up to a size (d+1)2, where d is the minimum Hamming distance of the MDS component code. The performance of MDS-based product codes with and without double-diversity coloring is analyzed in presence of both the block and the independent erasures. In the latter case, ML and iterative decoding are proven to coincide at small channel erasure probability. Furthermore, numerical results show excellent performance in presence of unequal erasure probability due to double-diversity colorings.

KW - Codes on graphs

KW - Differential evolution

KW - Distributed storage

KW - Diversity

KW - Edge coloring

KW - Erasure channel

KW - Iterative decoding

KW - MDS codes

KW - Product codes

KW - Stopping sets

UR - http://www.scopus.com/inward/record.url?scp=85013410536&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85013410536&partnerID=8YFLogxK

U2 - 10.1109/TIT.2017.2653806

DO - 10.1109/TIT.2017.2653806

M3 - Article

AN - SCOPUS:85013410536

VL - 63

SP - 1439

EP - 1462

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 3

M1 - 7819551

ER -