A reduced upper bound on the error correction ability of codes (Corresp.)

J. Bartow

W. W. Peterson

Charles V. Freiman, John P. Robinson

Wan Kim

Torleiv Kløve

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.

Chin-Long Chen, W. J. Warren

Construction of shortened geometric codes as Shown here results in 1-step majority-logic deeodable codes. The shortened codes retain the error-correction ability of the parent codes and the decoders for the shortened codes are much simpler than for the parent code. A table of shortened codes is given.