Ordered binary decision diagrams and minimal trellises

Ordered binary decision diagrams (OBDDs) are graph-based data structures for representing Boolean functions. They have found widespread use in computer-aided design and in formal verification of digital circuits. Minimal trellises are graphical representations of error-correcting codes that play a prominent role in coding theory. This paper establishes a close connection between these two graphical models, as follows. Let 𝒞 be a binary code of length n, and let f_c (x₁, ..., x_n) be the Boolean function that takes the value 0 at x₁, ..., x_n if and only if (x ₁, ..., x_n)∈𝒞. Given this natural one-to-one correspondence between Boolean functions and binary codes, we prove that the minimal proper trellis for a code 𝒞 with minimum distance d>1 is isomorphic to the single-terminal OBDD for its Boolean indicator function f_c(x₁, ..., x_n ). Prior to this result, the extensive research during the past decade on binary decision diagrams (in computer engineering) and on minimal trellises (in coding theory) has been carried out independently. As outlined in this work, the realization that binary decision diagrams and minimal trellises are essentially the same data structure opens up a range of promising possibilities for transfer of ideas between these disciplines