Title :
Upper bounds on codes correcting asymmetric errors (Corresp.)
fDate :
1/1/1981 12:00:00 AM
Abstract :
A Survey is given of known upper bounds on codes correcting asymmetric errors. The bounds are improved by introducing new Ideas. By solving a linear programming problem an upper bound is given that is easy to compute for all codelengths and all minimum asymmetric distances.
Keywords :
Error-correcting codes; Binary codes; Constraint theory; Error correction codes; Hamming distance; Hamming weight; Large scale integration; Linear programming; Shift registers; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1981.1056291
