SHORTENING OF CODES.

V. A. Zinov'ev, S. N. Litsyn

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)1-7
Number of pages7
JournalProblems of Information Transmission
Volume20
Issue number1
StatePublished - 1984

Fingerprint

Dive into the research topics of 'SHORTENING OF CODES.'. Together they form a unique fingerprint.

Cite this