Sparse codes derived from graphs

MaRDI QIDQ2822969zbMATH OpenFDO

Authors Shahrooz Janbaz, Zahra Taheri, Ali Zaghian

Publication date 5 October 2016

Published in Scientific Bulletin. Series A. Applied Mathematics and Physics. Politehnica University of Bucharest (Search for Journal in Brave)

zbMATH Keywords

weight distributioncovering radiusTanner graphcycle codesparse code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Sparse hypergraphs with applications to coding theory
• Structured Codes of Graphs
• Theoretical guarantees for graph sparse coding
• Sparse factor graph representations of Reed-Solomon and related codes
• Graph-based codes
• Nonlinear Sparse-Graph Codes for Lossy Compression
• Codes over graphs
• Sparsity. Graphs, structures, and algorithms
• Codes based on complete graphs

Cited in

(4)

• Good codes based on very sparse matrices
• Nonlinear Sparse-Graph Codes for Lossy Compression
• Conditionally Cycle-Free Graphical Models for Coset Codes
• Graph based linear error correcting codes

This page was built for publication: Sparse codes derived from graphs

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