Capacity of random channels with large alphabets

DOI10.3934/amc.2017060zbMath1386.94052arXiv1503.04108OpenAlexW3105175120MaRDI QIDQ1691253

John Lygeros, David Sutter, Tobias Sutter

Publication date: 15 January 2018

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

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

zbMATH Keywords

concentration of measurechannel capacityrandom channelBayesian experiment designduality of convex programming

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Information theory (general) (94A15) Statistical aspects of information-theoretic topics (62B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Quantum systems, channels, information. A mathematical introduction.
• Concentration of Measure Inequalities in Information Theory, Communications, and Coding
• Efficient Approximation of Channel Capacities
• On a Measure of the Information Provided by an Experiment
• Geometric Programming Duals of Channel Capacity and Rate Distortion
• Characterization and Computation of Optimal Distributions for Channel Coding
• Fading channels: information-theoretic and communications aspects
• Elements of Information Theory
• An algorithm for computing the capacity of arbitrary discrete memoryless channels
• Computation of channel capacity and rate-distortion functions
• Probability
• Random Matrix Theory and Wireless Communications
• Geometric Programming for Communication Systems

This page was built for publication: Capacity of random channels with large alphabets