Stopping sets of codes from complete graph

DOI10.1080/09720529.2019.1688909MaRDI QIDQ5865694zbMATH OpenOpenAlexFDO

Authors

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

complete graphlinear codestopping set

Mathematics Subject Classification ID

Combinatorial codes (94B25) Decoding (94B35)

Recommendations

• Codes based on complete graphs
• On graphs admitting codes identifying sets of vertices
• Codes from the line graphs of complete multipartite graphs and PD-sets
• Stopping Sets of Algebraic Geometry Codes
• Perfect codes in graphs
• scientific article; zbMATH DE number 2186985
• Parameterized codes over some embedded sets and their applications to complete graphs
• A construction of Gray codes inducing complete graphs
• Perfect codes over graphs
• Codes over graphs

Cites work

• Codes from incidence matrices of graphs
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• scientific article; zbMATH DE number 1996648 (Why is no real title available?)
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865694)