A Combinatorial Construction of Perfect Codes

A combinatorial construction for perfect binary single error correcting codes is presented. Several results are derived from this construction. In particular, we establish that there are a large number of nonisomorphic perfect codes of length 15.