Lesson plan

Trellis (graph)

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.

Back to article

Article summary

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.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.