CiteULike is a free online bibliography manager. Register and you can start organising your references online.
Tags

Finding a list of best paths in a trellis

by: G. Schmidt, V. R. Sidorenko, V. V. Zyablov, M. Bossert
In Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on (June 2004), 557, doi:10.1109/isit.2004.1365592  Key: citeulike:12090636

Formatted Citation


Show HTML

Likes (beta)

This copy of the article hasn't been liked by anyone yet.

View FullText article


Abstract

To find the best path in a trellis, the Viterbi algorithm can be used. We present an algorithm to find not only the best, but a sorted list of the ℓ best paths. Our algorithm is based on the Viterbi algorithm and iteratively applies a back-tracing procedure to find the ℓ best paths.


antoniawachter's tags for this article

Citations (CiTO)

No CiTO relationships defined

X There are no reviews yet

X Find related articles with these CiteULike tags

X Posting History


X Export records

Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.