Header

UZH-Logo

Maintenance Infos

Convolutional code constructions resulting in maximal or near maximal free distance


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.

Abstract

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.

Abstract

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.

Statistics

Altmetrics

Additional indexing

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
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:05 Apr 2016 13:26
Publisher:IEEE
ISBN:0-7803-5000-6
Publisher DOI:https://doi.org/10.1109/ISIT.1998.708913

Download

Full text not available from this repository.
View at publisher