The case for structured random codes in network capacity theorems
Authors:
- 25 April 2008
- journal article
- research article
- Published by Wiley in European Transactions on Telecommunications
- Vol. 19 (4) , 455-474
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Computation Over Multiple-Access ChannelsIEEE Transactions on Information Theory, 2007
- On the Capacity of Large Gaussian Relay NetworksIEEE Transactions on Information Theory, 2005
- Elements of Information Theory2001
- Comments on broadcast channelsIEEE Transactions on Information Theory, 1998
- An achievable rate region for the multiple-access channel with feedbackIEEE Transactions on Information Theory, 1981
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979
- How to encode the modulo-two sum of binary sources (Corresp.)IEEE Transactions on Information Theory, 1979
- A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)IEEE Transactions on Information Theory, 1975
- Group Codes do not Achieve Shannon's Channel Capacity for General Discrete ChannelsThe Annals of Mathematical Statistics, 1971
- Asymptotic Optimality of Group and Systematic Codes for Some ChannelsTheory of Probability & Its Applications, 1963