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

On Cyclic and Abelian 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
$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

2 Author(s)
Polcino Milies, C. ; Inst. de Mat. e Estatistica, Univ. de Sao Paulo, São Paulo, Brazil ; Diniz de Melo, F.

In this paper, the minimum weight and the dimension of all cyclic codes of length pn over a field Fq, are computed, when p is an odd prime and Fq a finite field with q̅ elements, assuming that Fq generates the group of invertible elements of Zpn. Furthermore, the minimum weight and dimension of codes which are sum of two minimal codes in Fq(Cp×Cp) are also computed. Finally, the efficiency of cyclic codes and noncyclic abelian codes of length p2 are compared.

Published in:

Information Theory, IEEE Transactions on  (Volume:59 ,  Issue: 11 )

Date of Publication:

Nov. 2013

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.