By Topic

Group Codes Outperform Binary-Coset Codes on Nonbinary Symmetric Memoryless Channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Como, G. ; Lab. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA, USA

Typical minimum distances and error exponents are analyzed on the 8-PSK Gaussian channel for two capacity-achieving code ensembles with different algebraic structure. It is proved that the typical group code over the cyclic group of order eight achieves both the Gilbert-Varshamov bound and the expurgated error exponent. On the other hand, the typical binary-coset codes (under any labeling) is shown to be bounded away both from the Gilbert-Varshamov bound (at any rate) and the expurgated exponent (at low rates). The reason for this phenomenon is shown to rely on the symmetry structure of the 8-PSK constellation, which is known to match the cyclic group of order eight, but not the direct product of three copies of the binary group. The presented results indicate that designing group codes matching the symmetry of the channel guarantees better typical-code performance than designing codes whose algebraic structure does not match the channel. This contrasts the well-known fact that the average binary-coset code achieves both the capacity and the random-coding error exponent of any discrete memoryless channel.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 9 )