Channel coding considerations for wireless LANs
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
The purpose of this paper is two-fold: first to show how a natural mathematical formulation of the "solution" of a system of recursion equations is formally almost identical with well-known formulations of a solution of a system of "iteration equations." The second aim is to present a construction which takes an algebraic theory T and yields another algebraic theory M(T) whose morphisms correspond to systems of recursion equations over T. This construction is highly uniform, i.e., the correspondence between T and M(T) is functorial. © 1983.
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics