On the Capacity of Abelian Group Codes Over Discrete Memoryless Channels

Details On the Capacity of Abelian Group Codes Over Discrete Memoryless Channels On the Capacity of Abelian Group Codes Over Discrete Memoryless Channels

2011-02-16

arxiv.org/abs/1102.3243v1

Computer Science

Information Theory

Scientific paper

For most discrete memoryless channels, there does not exist a linear code for the channel 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.

Affiliated with

Also associated with

No associations

Rating

On the Capacity of Abelian Group Codes Over Discrete Memoryless Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Capacity of Abelian Group Codes Over Discrete Memoryless Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Capacity of Abelian Group Codes Over Discrete Memoryless Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-416728