MINIMALITY AND DUALITY OF TAIL-BITING TRELLISES FOR LINEAR CODES
Codes can be represented by edge-labeled directed graphs called trellises, which are used in decoding with the Viterbi algorithm. We will first examine the well-known product construction for trellises and present an algorithm for recovering the factors of a given trellis. To maximize efficiency, tr...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
UKnowledge
2012
|
| Subjects: | |
| Online Access: | http://uknowledge.uky.edu/math_etds/1 http://uknowledge.uky.edu/cgi/viewcontent.cgi?article=1000&context=math_etds |