Perfect byte-correcting codes

  • Authors:

  • T. Etzion

  • Affiliations:

  • Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.90

Visualization

Abstract

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