Reed-Solomon convolutional codes

Heide Gluesing-Luerssen; Wiland Schmale

doi:10.1109/ISIT.2005.1523421

Reed-Solomon convolutional codes

Heide Gluesing-Luerssen, Wiland Schmale

Mathematics

Research output: Contribution to journal › Conference article › peer-review

Abstract

In this paper we will introduce a specific class of cyclic convolutional codes. The construction is based on Reed-Solomon block codes. The algebraic parameters as well as the distance of these codes are determined. This shows that some of these codes are optimal or near optimal.

Original language	English
Article number	1523421
Journal	IEEE International Symposium on Information Theory - Proceedings
Volume	2005-January
DOIs	https://doi.org/10.1109/ISIT.2005.1523421
State	Published - 2005
Event	2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia Duration: Sep 4 2005 → Sep 9 2005

Bibliographical note

Publisher Copyright:
© 2005 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2005.1523421

Cite this

@article{c92668ca667747d4afea6b183bff3525,

title = "Reed-Solomon convolutional codes",

abstract = "In this paper we will introduce a specific class of cyclic convolutional codes. The construction is based on Reed-Solomon block codes. The algebraic parameters as well as the distance of these codes are determined. This shows that some of these codes are optimal or near optimal.",

author = "Heide Gluesing-Luerssen and Wiland Schmale",

year = "2005",

doi = "10.1109/ISIT.2005.1523421",

language = "English",

volume = "2005-January",

}

TY - JOUR

T1 - Reed-Solomon convolutional codes

AU - Gluesing-Luerssen, Heide

AU - Schmale, Wiland

PY - 2005

Y1 - 2005

N2 - In this paper we will introduce a specific class of cyclic convolutional codes. The construction is based on Reed-Solomon block codes. The algebraic parameters as well as the distance of these codes are determined. This shows that some of these codes are optimal or near optimal.

AB - In this paper we will introduce a specific class of cyclic convolutional codes. The construction is based on Reed-Solomon block codes. The algebraic parameters as well as the distance of these codes are determined. This shows that some of these codes are optimal or near optimal.

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

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

U2 - 10.1109/ISIT.2005.1523421

DO - 10.1109/ISIT.2005.1523421

M3 - Conference article

AN - SCOPUS:85114375937

VL - 2005-January

M1 - 1523421

Y2 - 4 September 2005 through 9 September 2005

ER -

Reed-Solomon convolutional codes

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this