By Topic

On algebraic decoding of the Z4-linear Calderbank-McGuire code

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

3 Author(s)
Rong, C. ; Dept. of Inf., Bergen Univ., Norway ; Helleseth, T. ; Lahtonen, J.

The quaternary Calderbank-McGuire (see Des., Codes Cryptogr., vol.10, no.2, 1997) code is a Z4-linear code of length 32 which has 237 codewords and a minimum Lee distance of 12. The Gray map of this code is known to be a nonlinear binary (64, 237,12) code. The Z4-linear Calderbank-McGuire code can correct all errors with Lee weight ⩽5. An algebraic decoding algorithm for the code is presented in this paper. Furthermore, we discuss an alternative decoding method which takes advantage of the efficient BCH decoding algorithm

Published in:

Information Theory, IEEE Transactions on  (Volume:45 ,  Issue: 5 )