Stopping sets of codes from complete graph

DOI10.1080/09720529.2019.1688909zbMath1492.94214OpenAlexW3037512980MaRDI QIDQ5865694

No author found.

Publication date: 9 June 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2019.1688909

zbMATH Keywords

linear codecomplete graphstopping set

Mathematics Subject Classification ID

Combinatorial codes (94B25) Decoding (94B35)

Cites Work

• On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right\) shortened Hamming codes and their dual-codes]
• Codes from incidence matrices of graphs
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• Unnamed Item
• Unnamed Item

This page was built for publication: Stopping sets of codes from complete graph