By Topic

Algebraic construction of cyclic codes over Z8 with a good Euclidean minimum distance

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)
Piret, P.M. ; Canon Res. Centre France S.A., Cesson-Sevigne, France

Let S(8) denote the set of the eight admissible signals of an 8PSK communication system. The alphabet S(8) is endowed with the structure of Z8, the set of integers taken modulo 8, and codes are defined to be Z8-submodules of Z8n. Three cyclic codes over Z8 are then constructed. Their length is equal to 6, 8, and 7, and they, respectively, contain 64, 64, and 512 codewords. The square of their Euclidean minimum distance is equal to 8, 16-4√2 and 10-2√2, respectively. The size of the codes of length 6 and 7 can be doubled while the Euclidean minimum distance remains the same

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 3 )