We present a few new constructions for perfect linear single byte-correcting codes. These constructions generate some perfect single byte-correcting codes with new parameters, and some perfect single byte-correcting codes with known parameters and simpler presentation and implementation over the known codes. It is also shown that nonequivalent perfect linear single byte-correcting codes exist when all the bytes have the same size.
No takes yet. Share an insight, caveat, or question.
Tuvi Etzion (1998) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: