NASA NTRS · 19840054612
New syndrome decoding techniques for the (n, k) convolutional codes
Abstract
This paper presents a new syndrome decoding algorithm for the (n, k) convolutional codes (CC) which differs completely from an earlier syndrome decoding algorithm of Schalkwijk and Vinck. The new algorithm is based on the general solution of the syndrome equation, a linear Diophantine equation for the error polynomial vector E(D). The set of Diophantine solutions is a coset of the CC. In this error coset a recursive, Viterbi-like algorithm is developed to find the minimum weight error vector (circumflex)E(D). An example, illustrating the new decoding algorithm, is given for the binary nonsystemmatic (3, 1)CC. Previously announced in STAR as N83-34964
Keep this discovery
Explore connections, maps & timelines
Reed, I. S., Truong, T. K.. 1984-07-01. New syndrome decoding techniques for the (n, k) convolutional codes. https://searchnasa.com/record/nasa%3A19840054612/new-syndrome-decoding-techniques-for-the-n-k-convolutional-codes
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.