Some constructions of superimposed codes in Euclidean spaces. (Q1811096)

An \((n,m,d,T)\)-spherical superimposed code (SSC) is a finite subset \(C\) of \({\mathbb S}^{n-1}\) of cardinality \(T\) such that the minimum possible distance among the distinct sums of at most \(m\) vectors from \(C\) is \(d\). In the paper under review, the author describes some known bounds on the maximal possible cardinality of SSC for fixed \(n\), \(m\) and \(d\). Then some known constructions are reviewed and compared with three new constructions, one of them a generalization of the Ericson-Györfi construction [\textit{T. Ericson} and \textit{L. Györfi}, IEEE Trans. Inf. Theory 34, 877--880 (1988; Zbl 0657.94014)]. It is shown also that the simplex code is not optimal as an SSC, at least in dimensions \(n \geq 10\), despite the fact that it is a maximal spherical code and a minimal spherical 2-design.