The bidirectional stack algorithm

Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке: https://open.uns.ac.rs/handle/123456789/14982

Назив:	The bidirectional stack algorithm
Аутори:	Šenk, Vojin Radivojac P.
Датум издавања:	1-дец-1997
Часопис:	IEEE International Symposium on Information Theory - Proceedings
Сажетак:	A new procedure for sequential decoding of trellis codes, whose decoding effort is unaffected by single correctable bursts of errors of desired length (but not longer than the code constraint length) is simulated and compared with the classical stack algorithm. The results show an immense reduction in decoding effort. © 1997 IEEE.
URI:	https://open.uns.ac.rs/handle/123456789/14982
ISBN:	780339568
ISSN:	21578095
DOI:	10.1109/ISIT.1997.613437
Налази се у колекцијама:	FTN Publikacije/Publications