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

On the covering radius of Z4-codes and their lattices

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

5 Author(s)
Aoki, T. ; Dept. of Math. Sci., Yamagata Univ., Japan ; Gaborit, P. ; Harada, M. ; Ozeki, M.
more authors

In this correspondence, we investigate the covering radius of codes over Z4 for the Lee and Euclidean distances in relation with those of binary nonlinear codes and lattices obtained by the Gray map and Construction A4, respectively. We give several upper and lower bounds on covering radii, including Z4-analogs of the sphere-covering bound, the packing radius bound, the Delsarte bound, and the redundancy bound. We show that any Euclidean-optimal Type II code of length 24 has covering radius 8 with respect to the Euclidean distance. We determine the covering radius of the Klemm codes with respect to the Lee distance. We derive lower bounds on the covering radii of the Niemeier lattices

Published in:

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

Date of Publication:

Sep 1999

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.