Some optimal binary and ternary t-EC-AUED codes

  • Authors:
  • Irina Naydenova;Torleiv Kløve

  • Affiliations:
  • Department of Informatics, University of Bergen, Bergen, Norway;Department of Informatics, University of Bergen, Bergen, Norway

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

Quantified Score

Hi-index 754.84

Visualization

Abstract

Codes that can correct up to t symmetric errors and detect all unidirectional errors are studied. Böinck and van Tilborg gave a bound on the length of binary such codes. A generalization of this bound to arbitrary alphabet size is given. This generalized Böinck-van Tilborg bound, combined with constructions, is used to determine some optimal binary and ternary codes for correcting t symmetric errors and detecting all unidirectional errors.