A General Product Construction for Error Correcting Codes
Kevin T. Phelps · SIAM Journal on Algebraic and Discrete Methods · 1984
A product construction for binary error correcting codes is presented. Given perfect binary single error correcting codes of length n and m, one can construct perfect binary single error correcting codes of length $nm + n + m$. Among other things, the construction is used to establish that the number of nonequivalent (perfect) binary single error correcting codes of length n is at least $2^{2^{cn} } $, for some constant $c < 1$.