S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
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
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Nanda Kambhatla
ACL 2004
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering