By Topic

On the binary images of (8, 5) shortened cyclic codes over GF(28)

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
$33 $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)
H. Tokushige ; Hiroshima City Univ., Japan ; T. Tanoue ; T. Kasami

We consider the binary images of (8, 5) shortened cyclic codes. The (8, 5) shortened cyclic codes have a variety of choices. We have generated about 30000 sample codes with different weight distributions. Let Sw denote the set of generated sample codes with minimum weight w. The largest minimum weight of sample codes is 8. Let Aw denote the number of codewords of weight w of a sample code. In S 7, the smallest of A7 is 10 for 10 sample codes and the second smallest of A7 is 11 for six sample codes. In S7, the smallest of A8 is 728 for a sample code and the second smallest of A8 is 729 for a sample code. We have chosen two sample codes from each of S7 and S8 which have the smallest and the second smallest sums of A w for 7⩽w⩽9 in S7 and S8, respectively. For the AWGN channel using BPSK signaling, we have made simulation to evaluate the decoding error probabilities by a soft-decision decoding based on ordered statistics for the chosen four sample codes at SNR 2.0 to 5.0. These error probabilities are considerably smaller than the optimum error probabilities for (64, 40) subcodes of (64, 42) Reed-Muller code

Published in:

Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE  (Volume:2 )

Date of Conference:

2001