Abstract
The authors obtain some new bounds for the dual distance of generalized concatenated codes and BCH codes. The use of these bounds in the existing code-shortening arrangements leads to a number of new codes with optimal parameters. A new construction is proposed for shortening arbitrary (linear and nonlinear) codes. Application of this construction to existing codes yields a large number of codes with optimal known parameters.
| Original language | English |
|---|---|
| Pages (from-to) | 1-7 |
| Number of pages | 7 |
| Journal | Problems of Information Transmission |
| Volume | 20 |
| Issue number | 1 |
| State | Published - 1984 |