By Topic

Decomposition of cyclic codes of block lengths 3p, 5p, 7p (Corresp.)

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)

V. K. Bhargava recently made the following suggestion. Let C he a cyclic code of dimension p , and block length n , where n = tp, p is a prime. It is sometimes possible to find a code equivalent to C which has a generator matrix of the form [I|A_{1}| \cdots |A_{t-1}] where each A_{i} is a p \times p circulant matrix. Such a decomposition is useful in encoding and decoding and also in finding the weight distribution of C . Some general theory as to

Published in:

IEEE Transactions on Information Theory  (Volume:25 ,  Issue: 1 )