Abstract:
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...Show MoreMetadata
Abstract:
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: 2009 IEEE International Symposium on Information Theory
Date of Conference: 28 June 2009 - 03 July 2009
Date Added to IEEE Xplore: 18 August 2009
ISBN Information: