Redundancy of codes with graph constraints

DOI10.1007/978-981-19-9307-7_5MaRDI QIDQ6629091zbMATH OpenFDO

Authors Ghurumuruhan Ganesan

Publication date 29 October 2024

zbMATH Keywords

linear codesbipartite graphsfractional graph capacity

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• scientific article; zbMATH DE number 1504661 (Why is no real title available?)
• Algebraic Coding Theory Over Finite Commutative Rings
• Analogues of the Shannon Capacity of a Graph
• Expander codes
• Fundamentals of Error-Correcting Codes
• Linear complementary dual codes over rings
• Local correctability of expander codes
• Modern Coding Theory
• On the Shannon capacity of a graph
• On the Shannon capacity of probabilistic graphs
• Structure of linear codes over the ring \(B_k\)
• The Shannon capacity of a graph and the independence numbers of its powers
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

This page was built for publication: Redundancy of codes with graph constraints

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