RT Journal Article
A1 Wonjin Sung

PB iet
T1 Minimum decoding trellis lengths for tail-biting convolutional codes
JN Electronics Letters
VO 36
IS 7
SP 643
OP 645
AB Circular decoding is a simple decoding algorithm for tail-biting convolutional codes that essentially achieves maximum-likelihood decoding performance. An investigation into the minimum required length of the decoding trellis for circular decoding is presented for optimum free-distance codes of rates 1/2, 1/3 and 1/4.
K1 maximum-likelihood decoding
K1 circular decoding algorithm
K1 tail-biting convolutional code
K1 minimum decoding trellis length
DO https://doi.org/10.1049/el:20000517
UL https://digital-library.theiet.org/;jsessionid=4cmo8fg86je1i.x-iet-live-01content/journals/10.1049/el_20000517
LA English
SN 0013-5194
YR 2000
OL EN