Upper bounds on codes correcting asymmetric errors (Corresp.) |
| |
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: | |
|
|