Some Optimal Binary and Ternary $t$-EC-AUED Codes
Irina Naydenova, Torleiv Kløve · IEEE Transactions on Information Theory · 2009
Codes that can correct up totsymmetric 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 correctingtsymmetric errors and detecting all unidirectional errors.