The capacity of finite Abelian group codes over symmetric memoryless channels
(2009) In IEEE Transactions on Information Theory 55(5). p.2037-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... (More)
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.
(Less)
- author
- Como, Giacomo LU and Fagnani, Fabio
- publishing date
- 2009
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- Capacity, Channel coding theorem, Error exponent, Geometrically uniform constellation, Group codes, m-PSK, Nonbinary codes
- in
- IEEE Transactions on Information Theory
- volume
- 55
- issue
- 5
- pages
- 18 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- external identifiers
-
- scopus:65749089054
- ISSN
- 0018-9448
- DOI
- 10.1109/TIT.2009.2015992
- language
- English
- LU publication?
- no
- id
- bc41843e-5673-4fa9-8c01-d36793f0c19e
- date added to LUP
- 2022-03-22 13:16:37
- date last changed
- 2022-07-06 11:40:01
@article{bc41843e-5673-4fa9-8c01-d36793f0c19e,
abstract = {{<p>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.</p>}},
author = {{Como, Giacomo and Fagnani, Fabio}},
issn = {{0018-9448}},
keywords = {{Capacity; Channel coding theorem; Error exponent; Geometrically uniform constellation; Group codes; m-PSK; Nonbinary codes}},
language = {{eng}},
number = {{5}},
pages = {{2037--2054}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
series = {{IEEE Transactions on Information Theory}},
title = {{The capacity of finite Abelian group codes over symmetric memoryless channels}},
url = {{http://dx.doi.org/10.1109/TIT.2009.2015992}},
doi = {{10.1109/TIT.2009.2015992}},
volume = {{55}},
year = {{2009}},
}