On the capacity of Abelian group codes over discrete memoryless channels
Authors:
- 1 July 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1743-1747
Abstract
For most discrete memoryless channels, there does not exist a linear code which uses all of the channel's input symbols. Therefore, linearity of the code for such channels is a very restrictive condition and there should be a loosening of the algebraic structure of the code to a degree that the code can admit any channel input alphabet. For any channel input alphabet size, there always exists an Abelian group structure defined on the alphabet. We investigate the capacity of Abelian group codes over discrete memoryless channels and provide lower and upper bounds on the capacity.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- On the capacity of Abelian group codes over discrete memoryless channels2011
- Distributed Source Coding Using Abelian Group Codes: A New Achievable Rate-Distortion RegionIEEE Transactions on Information Theory, 2011
- The Capacity of Finite Abelian Group Codes Over Symmetric Memoryless ChannelsIEEE Transactions on Information Theory, 2009
- Computation Over Multiple-Access ChannelsIEEE Transactions on Information Theory, 2007
- Lattice Strategies for the Dirty Multiple Access Channel2007
- Distributed source coding using syndromes (DISCUS): design and constructionIEEE Transactions on Information Theory, 2003
- How to encode the modulo-two sum of binary sources (Corresp.)IEEE Transactions on Information Theory, 1979
- Bounds on algebraic code capacities for noisy channels. IInformation and Control, 1971
- Group Codes for the Gaussian ChannelBell System Technical Journal, 1968
- Asymptotic Optimality of Group and Systematic Codes for Some ChannelsTheory of Probability & Its Applications, 1963