We here summarize some recent advances in the study of linear deterministic networks, recently proposed as approximations for wireless channels. This work started by extending the algebraic framework developed for multicasting over graphs in [1] to include operations over matrices and to admit both graphs and linear deterministic networks as special cases. Our algorithms build on this generalized framework, and provide as special cases unicast and multicast algorithms for deterministic networks, as well as network code designs using structured matrices.