Achieving positive rates with predetermined dictionaries

DOI10.1007/978-3-030-67899-9_31OpenAlexW3128574727MaRDI QIDQ831747FDOQ831747

Authors: Ghurumuruhan Ganesan 

Publication date: 24 March 2022

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

zbMATH Keywords

positive ratespredetermined dictionaries

Mathematics Subject Classification ID

Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24) Algorithms in computer science (68Wxx)

Cites Work

• Elements of Information Theory
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Fundamentals of Error-Correcting Codes
• The method of types [information theory]
• Optimal Achievable Rates for Interference Networks With Random Codes
• Lattice Coding for Signals and Networks
• Graph decomposition: A new key to coding theorems

Cited In (1)

• Achieving positive rates with predetermined dictionaries

This page was built for publication: Achieving positive rates with predetermined dictionaries

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