By Topic

Some Optimal Binary and Ternary t -EC-AUED Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Naydenova, I. ; Dept. of Inf., Univ. of Bergen, Bergen, Norway ; Klove, T.

Codes that can correct up to t symmetric errors and detect all unidirectional errors are studied. BOumlinck 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 BOumlinck-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.

Published in:

Information Theory, IEEE Transactions on  (Volume:55 ,  Issue: 11 )