Abstract
In this paper we provide a state space approach for constructing convolutional codes of rate 1/n and complexity δ, whose free distance is n(δ+1), the maximal possible free distance.
Navigation auf zora.uzh.ch
Smarandache, R; Rosenthal, J (1998). A state space approach for constructing MDS rate 1/n convolutional codes. In: 1998 Information Theory Workshop. Piscataway, NJ: IEEE, 116-117.
In this paper we provide a state space approach for constructing convolutional codes of rate 1/n and complexity δ, whose free distance is n(δ+1), the maximal possible free distance.
Other titles: | IEEE Information Theory Workshop, KILLARNEY, IRELAND, JUN 22-26, 1998 |
---|---|
Item Type: | Book Section, refereed, original work |
Communities & Collections: | 07 Faculty of Science > Institute of Mathematics |
Dewey Decimal Classification: | 510 Mathematics |
Scopus Subject Areas: | Physical Sciences > Computational Theory and Mathematics
Physical Sciences > Computer Networks and Communications Physical Sciences > Information Systems Physical Sciences > Electrical and Electronic Engineering |
Uncontrolled Keywords: | MDS codes , complexity , convolutional codes , free distance , maximum distance separable codes , rate 1/n codes , state space approach |
Language: | English |
Date: | 1998 |
Deposited On: | 29 Nov 2010 16:28 |
Last Modified: | 03 Sep 2024 01:37 |
Publisher: | IEEE |
ISBN: | 0-7803-4408-1 |
OA Status: | Closed |
Publisher DOI: | https://doi.org/10.1109/ITW.1998.706461 |