1
Views
0
CrossRef citations to date
0
Altmetric
Letters to the Editor

Decoding Constraint Length for Viterbi Decoding of Ternary Convolutional Codes

&
Pages 607-608 | Received 26 Jun 1981, Published online: 10 Jul 2015
 

Abstract

Viterbi algorithm is simulated for ternary convolutional codes. Simulation results show that a decoding constraint length of 2 to 3 times the encoding constraint length is sufficient for levelling off the error probability at low cross-over probabilities of a ternary channel.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.