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

Cyclic codes and quadratic residue codes over Z4

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)
Pless, V.S. ; Dept. of Math. Stat. & Comput. Sci., Illinois Univ., Chicago, IL, USA ; Zhongqiang Qian

A set of n-tuples over Z4 is called a code over Z4 or a Z4 code if it is a Z4 module. We prove that any Z4-cyclic code C has generators of the form (fh, 2fg) where fgh=xn-1 over Z4 and |C|=4deg g 2deg h. We also show that C has generators of the form (g*h*, 2f*g*). We show that idempotent generators exist for certain cyclic codes. A particularly interesting family of Z4 -cyclic codes are quadratic residue codes. We define such codes in terms of their idempotent generators and show that these codes also have many good properties which are analogous in many respects to properties of quadratic residue codes over a field. We show that the nonlinear binary images of the extended QR codes of lengths 32 and 48 have higher minimum weights than comparable known linear codes

Published in:

Information Theory, IEEE Transactions on  (Volume:42 ,  Issue: 5 )

Date of Publication:

Sep 1996

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.