 | This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Trellis" graph – news · newspapers · books · scholar · JSTOR (January 2021) (Learn how and when to remove this message) |
A trellis is a graph whose nodes are ordered into vertical slices (time) with every node at almost every time connected to at least one node at an earlier and at least one node at a later time. The earliest and latest times in the trellis have only one node (hence the "almost" in the preceding sentence).
Trellises are used in encoders and decoders for communication theory and encryption. They are also the central datatype used in Baum–Welch algorithm or the Viterbi Algorithm for Hidden Markov Models.
The trellis graph is named for its similar appearance to an architectural trellis.
References
- Ryan, M. S., & Nudd, G. R. (1993). The viterbi algorithm. University of Warwick, Department of Computer Science.
See also
 | This graph theory-related article is a stub. You can help Misplaced Pages by expanding it. |
 | This article related to telecommunications is a stub. You can help Misplaced Pages by expanding it. |