NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Simplified Syndrome Decoding of (n, 1) Convolutional CodesA new syndrome decoding algorithm for the (n, 1) convolutional codes (CC) that is different and simpler than the previous syndrome decoding algorithm of Schalkwijk and Vinck is presented. The new algorithm uses the general solution of the polynomial linear Diophantine equation for the error polynomial vector E(D). This set of Diophantine solutions is a coset of the CC space. A recursive or Viterbi-like algorithm is developed to find the minimum weight error vector cirumflex E(D) in this error coset. An example illustrating the new decoding algorithm is given for the binary nonsymmetric (2,1)CC.
Document ID
19830019756
Acquisition Source
Jet Propulsion Laboratory
Document Type
Other
Authors
I. S. Reed
(University of Southern California Los Angeles, United States)
T. K. Truong
(Jet Propulsion Laboratory La Cañada Flintridge, United States)
Date Acquired
August 11, 2013
Publication Date
May 15, 1983
Publication Information
Publication: The Telecommunications and Data Acquisition Report
Subject Category
Computer Programming And Software
Accession Number
83N28027
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.
Document Inquiry

Available Downloads

There are no available downloads for this record.
No Preview Available