DocumentCode
750027
Title
The Capacity of Finite Abelian Group Codes Over Symmetric Memoryless Channels
Author
Como, Giacomo ; Fagnani, Fabio
Volume
55
Issue
5
fYear
2009
fDate
5/1/2009 12:00:00 AM
Firstpage
2037
Lastpage
2054
Abstract
The capacity of finite Abelian group codes over symmetric memoryless channels is determined. For certain important examples, such as m -PSK constellations over additive white Gaussian noise (AWGN) channels, with m a prime power, it is shown that this capacity coincides with the Shannon capacity; i.e., there is no loss in capacity using group codes. (This had previously been known for binary-linear codes used over binary-input output-symmetric memoryless channels.) On the other hand, a counterexample involving a three-dimensional geometrically uniform constellation is presented in which the use of Abelian group codes leads to a loss in capacity. The error exponent of the average group code is determined, and it is shown to be bounded away from the random-coding error exponent, at low rates, for finite Abelian groups not admitting Galois field structure.
Keywords
channel coding; group codes; memoryless systems; random codes; 3D geometrically uniform constellation; Galois field structure; Shannon capacity; additive white Gaussian noise channels; binary linear codes; binary-input output-symmetric memoryless channels; finite Abelian group codes; m-PSK constellations; phase shift keying; random coding error exponent; AWGN; Additive white noise; Australia; Channel coding; Decoding; Galois fields; Information theory; Linear code; Memoryless systems; Parity check codes; $m$ -PSK; Capacity; channel coding theorem; error exponent; geometrically uniform constellation; group codes; nonbinary codes;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2009.2015992
Filename
4839038
Link To Document