Cart (Loading....) | Create Account
Close category search window
 

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
$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)

V. K. Bhargava recently made the following suggestion. LetChe a cyclic code of dimensionp, and block lengthn, wheren = tp, pis a prime. It is sometimes possible to find a code equivalent toCwhich has a generator matrix of the form[I|A_{1}| cdots |A_{t-1}]where eachA_{i}is ap times pcirculant matrix. Such a decomposition is useful in encoding and decoding and also in finding the weight distribution ofC. Some general theory as to

Published in:

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

Date of Publication:

Jan 1979

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.