Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Paper
State Splitting for Variable-Length Graphs
Abstract
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. © 1986 IEEE
Related
Conference paper
Failure diagnosis with incomplete information in cable networks
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
Raymond Wu, Jie Lu
ITA Conference 2007
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014