Coordination and discoordination in linear algebra, linear information theory, and coded caching

DOI10.1016/j.laa.2023.05.015zbMath1514.94012arXiv2204.11802OpenAlexW4377092191MaRDI QIDQ6161139

No author found.

Publication date: 26 June 2023

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.11802

zbMATH Keywords

information theorycoordinationlinear algebradiscoordinationcoded caching

Mathematics Subject Classification ID

Information theory (general) (94A15) Vector spaces, linear dependence, rank, lineability (15A03) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New inequalities for subspace arrangements
• Pavings of simplexes, pasted schemes of graphs and compactification of \(\text{PGL}_r^{n+1}/\text{PGL}_r\)
• Inequalities for Shannon entropy and Kolmogorov complexity
• Linear Algebra Done Right
• Fundamental Limits of Caching
• Conditional Independences among Four Random Variables III: Final Conclusion
• A framework for linear information inequalities
• Doubly Exponentially Many Ingleton Matroids
• Characterizing the Rate-Memory Tradeoff in Cache Networks Within a Factor of 2
• Elements of Information Theory
• Erratum: Paving of simplices, pasted schemes of graphs and compactification of \(\text{PGL}_r^{n+1}/ \text{PGL}_r\)

This page was built for publication: Coordination and discoordination in linear algebra, linear information theory, and coded caching