Publication
IEEE Trans. Inf. Theory
Paper

State Splitting for Variable-Length Graphs

View publication

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

Date

Publication

IEEE Trans. Inf. Theory

Authors

Topics

Share