An Algebraic and Probabilistic Framework for Network Information Theory

DOI10.1561/0100000083MaRDI QIDQ5855374zbMATH OpenOpenAlexFDO

Authors S. Sandeep Pradhan, Arun Padakandla, Farhad Shirani

Publication date 18 March 2021

Published in Foundations and Trends™ in Communications and Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1561/0100000083

zbMATH Keywords

asymptotically good random structured codeschannel codingmultiterminal communication problems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Information theory (general) (94A15)

Recommendations

• An approximation approach to network information theory
• Network information theory
• Information theory of networks
• Network Coding Theory Via Commutative Algebra
• Information theory perspective on network robustness
• Information theory and network coding
• Euclidean Information Theory of Networks
• Towards an information theory of large networks: an achievable rate region
• Information theory and communication networks: an unconsummated union

Cited in

(7)

• An approximation approach to network information theory
• An algebraic framework for information theory: classical information
• Networks, Matroids, and Non-Shannon Information Inequalities
• scientific article; zbMATH DE number 708810 (Why is no real title available?)
• Nested linear/lattice codes for structured multiterminal binning
• Information theory and communication networks: an unconsummated union
• scientific article; zbMATH DE number 2109351 (Why is no real title available?)

This page was built for publication: An Algebraic and Probabilistic Framework for Network Information Theory

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