Redundancy of codes with graph constraints

DOI10.1007/978-981-19-9307-7_5MaRDI QIDQ6629091FDOQ6629091

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

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

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)