Effect of one redundant parity-check equation on the stopping distance

DOI10.1007/s12190-018-1170-3zbMath1443.94112OpenAlexW2793692225MaRDI QIDQ2317393

Farhad Rahmati, Mohammad H. Tadayon, Zahra Ferdosi

Publication date: 9 August 2019

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-018-1170-3

zbMATH Keywords

stopping setiterative decodingstopping distancearray LDPC codesbinary erasure channel (BEC)

Mathematics Subject Classification ID

Decoding (94B35)

Cites Work

• Linear Algebra Done Right
• On the Minimum/Stopping Distance of Array Low-Density Parity-Check Codes
• On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices
• Finding All Small Error-Prone Substructures in LDPC Codes
• On the complexity of sphere decoding in digital communications

This page was built for publication: Effect of one redundant parity-check equation on the stopping distance