By Topic

Concatenated group codes and their exponents

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)

Codes that are concatenations of group codes are considered. It is shown that when G and H are finite groups and the inner and outer codes are G- and H- codes, respectively, then under certain conditions the concatenated code is a G \times H code. A necessary and sufficient condition is given for a G \times H code to have a structure as a concatenated code. Further, under the assumption that all group algebras involved are semisimple, it is shown how the character of a concatenated code can be expressed in terms of the characters of the inner and outer codes. This leads to an application of a result by Ward [5] which enables one to find (or lower bound) the exponent of the concatenated code by a computation on characters of G and H . In an example this result enables the improvement of the usual minimum distance bound on concatenated codes. A general upper bound on the exponent of concatenated group codes is proved, and it is shown to be tight by an example.

Published in:

Information Theory, IEEE Transactions on  (Volume:33 ,  Issue: 6 )