Multidimensional decoding networks for trapping set analysis

Allison Beemer, Christine A. Kelley

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present a novel multidimensional network model as a means to analyze decoder failure and characterize trapping sets of graph-based codes. We identify a special class of these decoding networks, which we call transitive networks, and show how they may be used to identify trapping sets and inducing sets. Many codes have transitive decoding network representations. We conclude by investigating the decoding networks of codes arising from product, half-product, and protograph code constructions.

Original languageEnglish (US)
Title of host publicationCoding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings
EditorsAngela I. Barbero, Vitaly Skachek, Oyvind Beck
PublisherSpringer Verlag
Pages11-20
Number of pages10
ISBN (Print)9783319662770
DOIs
StatePublished - Jan 1 2017
Event5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017 - Vihula, Estonia
Duration: Aug 28 2017Aug 31 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10495 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017
CountryEstonia
CityVihula
Period8/28/178/31/17

Fingerprint

Trapping
Decoding
Multidimensional Model
Network Model
Graph in graph theory

Keywords

  • Finite state machines
  • Iterative decoding
  • LDPC codes
  • Multidimensional decoding networks
  • Redundancy
  • Trapping sets

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Beemer, A., & Kelley, C. A. (2017). Multidimensional decoding networks for trapping set analysis. In A. I. Barbero, V. Skachek, & O. Beck (Eds.), Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings (pp. 11-20). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10495 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-66278-7_2

Multidimensional decoding networks for trapping set analysis. / Beemer, Allison; Kelley, Christine A.

Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. ed. / Angela I. Barbero; Vitaly Skachek; Oyvind Beck. Springer Verlag, 2017. p. 11-20 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10495 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Beemer, A & Kelley, CA 2017, Multidimensional decoding networks for trapping set analysis. in AI Barbero, V Skachek & O Beck (eds), Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10495 LNCS, Springer Verlag, pp. 11-20, 5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017, Vihula, Estonia, 8/28/17. https://doi.org/10.1007/978-3-319-66278-7_2
Beemer A, Kelley CA. Multidimensional decoding networks for trapping set analysis. In Barbero AI, Skachek V, Beck O, editors, Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. Springer Verlag. 2017. p. 11-20. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-66278-7_2
Beemer, Allison ; Kelley, Christine A. / Multidimensional decoding networks for trapping set analysis. Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. editor / Angela I. Barbero ; Vitaly Skachek ; Oyvind Beck. Springer Verlag, 2017. pp. 11-20 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c6b18cfbefaf4e87a32748b3dc9387b9,
title = "Multidimensional decoding networks for trapping set analysis",
abstract = "We present a novel multidimensional network model as a means to analyze decoder failure and characterize trapping sets of graph-based codes. We identify a special class of these decoding networks, which we call transitive networks, and show how they may be used to identify trapping sets and inducing sets. Many codes have transitive decoding network representations. We conclude by investigating the decoding networks of codes arising from product, half-product, and protograph code constructions.",
keywords = "Finite state machines, Iterative decoding, LDPC codes, Multidimensional decoding networks, Redundancy, Trapping sets",
author = "Allison Beemer and Kelley, {Christine A.}",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-66278-7_2",
language = "English (US)",
isbn = "9783319662770",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "11--20",
editor = "Barbero, {Angela I.} and Vitaly Skachek and Oyvind Beck",
booktitle = "Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings",

}

TY - GEN

T1 - Multidimensional decoding networks for trapping set analysis

AU - Beemer, Allison

AU - Kelley, Christine A.

PY - 2017/1/1

Y1 - 2017/1/1

N2 - We present a novel multidimensional network model as a means to analyze decoder failure and characterize trapping sets of graph-based codes. We identify a special class of these decoding networks, which we call transitive networks, and show how they may be used to identify trapping sets and inducing sets. Many codes have transitive decoding network representations. We conclude by investigating the decoding networks of codes arising from product, half-product, and protograph code constructions.

AB - We present a novel multidimensional network model as a means to analyze decoder failure and characterize trapping sets of graph-based codes. We identify a special class of these decoding networks, which we call transitive networks, and show how they may be used to identify trapping sets and inducing sets. Many codes have transitive decoding network representations. We conclude by investigating the decoding networks of codes arising from product, half-product, and protograph code constructions.

KW - Finite state machines

KW - Iterative decoding

KW - LDPC codes

KW - Multidimensional decoding networks

KW - Redundancy

KW - Trapping sets

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

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

U2 - 10.1007/978-3-319-66278-7_2

DO - 10.1007/978-3-319-66278-7_2

M3 - Conference contribution

AN - SCOPUS:85028547886

SN - 9783319662770

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 11

EP - 20

BT - Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings

A2 - Barbero, Angela I.

A2 - Skachek, Vitaly

A2 - Beck, Oyvind

PB - Springer Verlag

ER -