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

Nonbinary double-error-correcting codes designed by means of algebraic varieties

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)
Dumer, I. ; Inst. for Problems of Inf. Transmission, Acad. of Sci., Moscow, Russia

Linear q-ary codes of growing length n→∞ and designed distance δ are studied. At first, we examine cyclic codes defined by the sets of code zeros {gi|i=qs+1, qs+1 +1, ···, qs+δ-2+1} over a primitive element g of GF(qm). Then special cubic varieties are designed and employed in order to attain distances δ=5, 6. The resulting double-error-correcting codes of length n=qm have r⩽2m+[m/3]+1 parity check symbols, and reduce the best known redundancy by [2m/3] symbols. A decoding procedure of complexity O(rn) operations is also considered

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 6 )

Date of Publication:

Nov 1995

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.