Navigation auf zora.uzh.ch
Smarandache, R; Rosenthal, J (1998). Convolutional code constructions resulting in maximal or near maximal free distance. In: 1998 IEEE International Symposium on Information Theory. Proceedings. Piscataway, NJ: IEEE, 308.
We discuss an upper bound on the free distance for a rate k/n convolutional code with complexity δ. Using this bound we introduce the notion of a MDS convolutional code. We also give an algebraic way of constructing binary codes of rate 1/2 and large complexity. The obtained distances compare favorably to the distances found by computer searches and probabilistic methods.
| Other titles: | IEEE International Symposium on Information Theory, CAMBRIDGE, MA, AUG 16-22, 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 > Theoretical Computer Science
Physical Sciences > Information Systems Physical Sciences > Modeling and Simulation Physical Sciences > Applied Mathematics |
| Uncontrolled Keywords: | MDS convolutional code , binary codes , complexity , convolutional code constructions , large complexity codes , maximal free distance , near maximal free distance , rate 1/2 codes , rate k/n convolutional code |
| Language: | English |
| Date: | 1998 |
| Deposited On: | 22 Dec 2009 13:21 |
| Last Modified: | 03 May 2025 01:37 |
| Publisher: | IEEE |
| ISBN: | 0-7803-5000-6 |
| OA Status: | Closed |
| Publisher DOI: | https://doi.org/10.1109/ISIT.1998.708913 |
Smarandache, R