By Topic

Cycle representatives of quasi-irreducible two-dimensional cyclic codes

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

1 Author(s)
S. Sakata ; Dept. of Production Syst. Eng., Toyohashi Univ. of Technol., Tempaku, Japan

The author presents a method of finding the cycle representatives of any quasi-irreducible (QIR) 2-D cyclic code by extending A.P. Kurdjukov's (Probl. Peredach. Inform., vol.12, no.4, p.107-8, 1976) result on quasi-irreducible (i.e. nonsquare-free) 10D cyclic codes. The algorithm is not strictly deterministic in the sense that it is necessary to obtain a set of representative arrays for the code by a trial-and-error method. The result is useful for finding the cycle representatives of any 2D cyclic code by combining QIR components with the aid of G. Sequin's (1974) method to the case where the symbol field is the binary Galois field GF(2). In particular, the result is useful for determining the weight distribution of any two-dimensional cyclic code

Published in:

IEEE Transactions on Information Theory  (Volume:34 ,  Issue: 4 )