SHORTENING OF CODES.

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

SHORTENING OF CODES.

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

^*Corresponding author for this work

School of Electrical Engineering

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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

Cite this

@article{a3ba9f5a30f942a7b4ad1b0d2a981eba,

title = "SHORTENING OF CODES.",

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.",

author = "Zinov'ev, \{V. A.\} and Litsyn, \{S. N.\}",

year = "1984",

language = "אנגלית",

volume = "20",

pages = "1--7",

journal = "Problems of Information Transmission",

issn = "0032-9460",

publisher = "Pleiades Publishing",

number = "1",

}

TY - JOUR

T1 - SHORTENING OF CODES.

AU - Zinov'ev, V. A.

AU - Litsyn, S. N.

PY - 1984

Y1 - 1984

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0021303535

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0021303535

SN - 0032-9460

VL - 20

SP - 1

EP - 7

JO - Problems of Information Transmission

JF - Problems of Information Transmission

IS - 1

ER -

SHORTENING OF CODES.

Abstract

Other files and links

Fingerprint

Cite this