NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
On the error probability of general trellis codes with applications to sequential decodingAn upper bound on the average probability of error for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n with distinction between memory length and tail length is given. It is shown that the bound is independent of the length L of the information sequence if the memory length exceeds the tail length by a specified amount that depends on L. Sequential decoding simulations using the stack algorithm were conducted to test the dependence of the undetected error probability on tail length and memory length, and the results corroborated the theory.
Document ID
19770063309
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
Authors
Johannesson, R.
(Lund, Universitet Lund, Sweden)
Date Acquired
August 9, 2013
Publication Date
September 1, 1977
Publication Information
Publication: IEEE Transactions on Information Theory
Volume: IT-23
Subject Category
Cybernetics
Accession Number
77A46161
Funding Number(s)
CONTRACT_GRANT: NGL-15-004-026
CONTRACT_GRANT: SBTD-75-4165
Distribution Limits
Public
Copyright
Other

Available Downloads

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