Conference paper
Social networks and discovery in the enterprise (SaND)
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
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
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Thomas R. Puzak, A. Hartstein, et al.
CF 2007