Stopping and trapping sets in generalized covering arrays

Olgica Milenkovie, Emina Soljanin, Philip Whiting

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

6 Scopus citations

Abstract

Certain combinatorial structures embedded in the parity-check matrix of linear codes, such as stopping and trapping sets, are known to govern the behavior of the codes' bit error rate curves under iterative decoding. We show how the Lovász Local Lemma can be used to obtain ε-probability bounds on the frequency of occurrence of such structures. In particular, the results are developed for two random ensembles of arrays. Arrays in the first ensemble consist of i.i.d. Bernoulli random variables, while the rows of the arrays in the second ensemble are chosen uniformly at random from the set of codewords of a linear block-code.

Original languageEnglish (US)
Title of host publication2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages259-264
Number of pages6
ISBN (Print)1424403502, 9781424403509
DOIs
StatePublished - Jan 1 2006
Externally publishedYes
Event2006 40th Annual Conference on Information Sciences and Systems, CISS 2006 - Princeton, NJ, United States
Duration: Mar 22 2006Mar 24 2006

Publication series

Name2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

Other

Other2006 40th Annual Conference on Information Sciences and Systems, CISS 2006
Country/TerritoryUnited States
CityPrinceton, NJ
Period3/22/063/24/06

All Science Journal Classification (ASJC) codes

  • General Computer Science

Fingerprint

Dive into the research topics of 'Stopping and trapping sets in generalized covering arrays'. Together they form a unique fingerprint.

Cite this