Double and Triple Node-Erasure-Correcting Codes Over Complete Graphs

DOI10.1109/TIT.2020.2971997MaRDI QIDQ5124420zbMATH OpenOpenAlexFDO

Authors Lev Yohananov, Yuval Efron, Eitan Yaakobi

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2020.2971997

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Combinatorial codes (94B25)

Recommendations

• scientific article; zbMATH DE number 5633587
• Error-correcting codes from graphs
• Graph theoretic error-correcting codes
• Erasure correction and locality of hypergraph codes
• Ternary graph theoretic error-correcting codes (Corresp.)
• On the Error-Correcting Capabilities of Cycle Codes of Graphs
• On the Number of Errors Correctable with Codes on Graphs
• scientific article; zbMATH DE number 4062991
• Codes for Graph Erasures
• scientific article; zbMATH DE number 1552123

This page was built for publication: Double and Triple Node-Erasure-Correcting Codes Over Complete Graphs

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