Constructions of MDS-convolutional codes

R. Smarandache; H. Gluesing-Luerssen; J. Rosenthal

doi:10.1109/18.930938

Constructions of MDS-convolutional codes

R. Smarandache, H. Gluesing-Luerssen, J. Rosenthal

Mathematics

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

66 Scopus citations

Abstract

Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized Singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate k/n and each degree δ. The construction is based on a well-known connection between quasi-cyclic codes and convolutional codes.

Original language	English
Pages (from-to)	2045-2049
Number of pages	5
Journal	IEEE Transactions on Information Theory
Volume	47
Issue number	5
DOIs	https://doi.org/10.1109/18.930938
State	Published - Jul 2001

Bibliographical note

Funding Information:
Manuscript received September 15, 1999; revised November 30, 2000. This work was supported in part by NSF under Grants DMS-96-10389 and DMS-00-72383. The work of R. Smarandache was supported by a fellowship from the Center of Applied Mathematics at the University of Notre Dame. J. Rosenthal was carrying out this work while he was a Guest Professor at EPFL in Switzerland. The material in this correspondence was presented in part at the 2000 IEEE International Symposium on Information Theory, Sorrento, Italy, June 25–30, 2000.

Keywords

Convolutional codes
Generalized Singleton bound
Maximum-distance separable (MDS) convolutional codes

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/18.930938

Cite this

@article{a49c6b871258458b9800af1a58f25393,

title = "Constructions of MDS-convolutional codes",

abstract = "Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized Singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate k/n and each degree δ. The construction is based on a well-known connection between quasi-cyclic codes and convolutional codes.",

keywords = "Convolutional codes, Generalized Singleton bound, Maximum-distance separable (MDS) convolutional codes",

author = "R. Smarandache and H. Gluesing-Luerssen and J. Rosenthal",

note = "Funding Information: Manuscript received September 15, 1999; revised November 30, 2000. This work was supported in part by NSF under Grants DMS-96-10389 and DMS-00-72383. The work of R. Smarandache was supported by a fellowship from the Center of Applied Mathematics at the University of Notre Dame. J. Rosenthal was carrying out this work while he was a Guest Professor at EPFL in Switzerland. The material in this correspondence was presented in part at the 2000 IEEE International Symposium on Information Theory, Sorrento, Italy, June 25–30, 2000.",

year = "2001",

month = jul,

doi = "10.1109/18.930938",

language = "English",

volume = "47",

pages = "2045--2049",

number = "5",

}

TY - JOUR

T1 - Constructions of MDS-convolutional codes

AU - Smarandache, R.

AU - Gluesing-Luerssen, H.

AU - Rosenthal, J.

N1 - Funding Information: Manuscript received September 15, 1999; revised November 30, 2000. This work was supported in part by NSF under Grants DMS-96-10389 and DMS-00-72383. The work of R. Smarandache was supported by a fellowship from the Center of Applied Mathematics at the University of Notre Dame. J. Rosenthal was carrying out this work while he was a Guest Professor at EPFL in Switzerland. The material in this correspondence was presented in part at the 2000 IEEE International Symposium on Information Theory, Sorrento, Italy, June 25–30, 2000.

PY - 2001/7

Y1 - 2001/7

N2 - Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized Singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate k/n and each degree δ. The construction is based on a well-known connection between quasi-cyclic codes and convolutional codes.

AB - Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized Singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate k/n and each degree δ. The construction is based on a well-known connection between quasi-cyclic codes and convolutional codes.

KW - Convolutional codes

KW - Generalized Singleton bound

KW - Maximum-distance separable (MDS) convolutional codes

UR - http://www.scopus.com/inward/record.url?scp=0035395695&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035395695&partnerID=8YFLogxK

U2 - 10.1109/18.930938

DO - 10.1109/18.930938

M3 - Article

AN - SCOPUS:0035395695

SN - 0018-9448

VL - 47

SP - 2045

EP - 2049

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 5

ER -

Constructions of MDS-convolutional codes

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this