Some periodic convolutional codes better than any fixed code (Corresp.)

Author

Mooser, Michel

Volume

Issue

fYear

1983

fDate

9/1/1983 12:00:00 AM

Firstpage

750

Lastpage

751

Abstract

Some $(n_{o}=2; k_{o}=1)$ noncatastrophic periodic convolutional codes with memory $M=4$ are given that have the same free distance, $d_{\\infty }$ , as the best fixed code but have both a smaller number of paths of weight $d_{\\infty }$ per time instant and a smaller average number of information bit errors per such path for periods $T=2, 3, 4$ , and $5$ . It is also shown that an $(n_{0}, k_{0})$ code of period $T$ is equivalent to a fixed code with parameters $(Tn_{0}, Tk_{0})$ .

Keywords

Convolutional coding; Convolutional codes; Error probability; Indium tin oxide; Maximum likelihood decoding; Viterbi algorithm;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.1983.1056727

Filename

1056727

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=937041