DocumentCode
2478345
Title
Convolutional code constructions resulting in maximal or near maximal free distance
Author
Smarandache, Roxana ; Rosenthal, Joachim
Author_Institution
Dept. of Math., Notre Dame Univ., IN, USA
fYear
1998
fDate
16-21 Aug 1998
Firstpage
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
Keywords
binary codes; computational complexity; convolutional codes; 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; Binary codes; Block codes; Convolutional codes; Galois fields; Mathematics; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708913
Filename
708913
Link To Document