We present a few new constructions for perfect linear single byte-correctin
g codes. These constructions generate some perfect single byte-correcting c
odes with new parameters, and some perfect single byte-correcting codes wit
h known parameters and simpler presentation and implementation over the kno
wn codes. It is also shown that nonequivalent perfect linear single byte-co
rrecting codes exist when all the bytes have the same size.