Concatenation Method for Construction of Spherical Codes in $n$-Dimensional Euclidean Space

A new construction is proposed for spherical codes of finite dimension $n$, based on two families of binary codes: constant-weight codes and ordinary block codes. This construction produces, in particular, some known optimal constructions with Euclidean distance $\rho=1$. For smaller $\rho$, the spherical codes constructed by this method essentially improve the existing lower bounds on cardinality of best codes obtained in previous studies for finite $n$.