Referenced Items are not available for this document.
Using lower bounds on components of the distance spectrum of a code on the Euclidean sphere obtained by linear programming, we derive new, better than known, upper bounds on the size of multiple packings.
Published in:
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Date of Conference: June 28 2009-July 3 2009
- Page(s):
- 1244 - 1247
- E-ISBN :
- 978-1-4244-4313-0
- Print ISBN:
- 978-1-4244-4312-3
- INSPEC Accession Number:
- 10842487
- Conference Location :
- Seoul
- Digital Object Identifier :
- 10.1109/ISIT.2009.5205969
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
