On the minimum stopping sets of product codes

DOI10.22108/toc.2017.101199.1465zbMath1463.94064OpenAlexW2891263243MaRDI QIDQ5135468

M. Hivadi, Chavoshi Akbar Zare

Publication date: 20 November 2020

Full work available at URL: https://toc.ui.ac.ir/article_22519_fbd0739ed66110173ab585dee89b4301.pdf

zbMATH Keywords

stopping setproduct codestopping distance

Mathematics Subject Classification ID

Combinatorial codes (94B25) Decoding (94B35)

Cites Work

• Unnamed Item
• Computing the Stopping Distance of a Tanner Graph Is NP-Hard
• Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• Introduction to Coding Theory

This page was built for publication: On the minimum stopping sets of product codes