|
Problemy Peredachi Informatsii, 1984, Volume 20, Issue 1, Pages 3–11
(Mi ppi1116)
|
|
|
|
Coding Theory
On Shortening of Codes
V. A. Zinov'ev, S. N. Litsyn
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.
Received: 17.04.1982
Citation:
V. A. Zinov'ev, S. N. Litsyn, “On Shortening of Codes”, Probl. Peredachi Inf., 20:1 (1984), 3–11; Problems Inform. Transmission, 20:1 (1984), 1–7
Linking options:
https://www.mathnet.ru/eng/ppi1116 https://www.mathnet.ru/eng/ppi/v20/i1/p3
|
Statistics & downloads: |
Abstract page: | 334 | Full-text PDF : | 185 | First page: | 2 |
|