Some constructions of superimposed codes in Euclidean spaces

Authors:
Danyo Danev
Affiliations:
Department of Electrical Engineering, Linköping University, 581 83 Linköping, Sweden
Venue:
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Year:
2003

Citing 6
Cited 1

Sphere-packings, lattices, and groups

Sphere-packings, lattices, and groups
On spherical codes generating the kissing number in dimensions 8 and 24

Discrete Mathematics - A collection of contributions in honour of Jack van Lint
Upper bounds on the minimum distance of spherical codes

IEEE Transactions on Information Theory
An improved upper bound of the rate of Euclidean superimposed codes

IEEE Transactions on Information Theory
Superimposed codes in Rn

IEEE Transactions on Information Theory
Spherical codes generated by binary partitions of symmetric pointsets

IEEE Transactions on Information Theory

Superimposed code based channel assignment in multi-radio multi-channel wireless mesh networks

Proceedings of the 13th annual ACM international conference on Mobile computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe three new methods for obtaining superimposed codes in Euclidean spaces. With help of them we construct codes with parameters improving upon known constructions. We also prove that the spherical simplex code is not optimal as superimposed code at least for dimensions greater than 9.