Some constructions of superimposed codes in Euclidean spaces
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
| Hi-index | 754.84 |
The authors introduce the concept of superimposed codes in Euclidean n-space Rn. An asymptotic existence bound is derived for such codes; the proof uses the idea of random coding. In particular, the asymptotic properties of long codes are studied. It is shown that the derived existence bound differs only by a factor of four from a nonexistence bound obtained by a simple sphere-packing argument