State splitting for variable-length graphs (Corresp.)
Roy L. Adler, Joel I. Friedman, Bruce Kitchens, Brian H. Marcus · IEEE Transactions on Information Theory · 1986
The state splitting algorithm of Adler, Coppersmith, and Hassner for graphs with edges of fixed length is extended to graphs with edges of variable lengths. This has the potential to improve modulation code construction techniques. Although the ideas of state splitting come from dynamical systems, completely graph-theoretic terms are used.