Conference paper
Channel coding considerations for wireless LANs
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
We prove the direct sum conjecture for various sets of systems of bilinear forms. Our results depend on a priori knowledge of the complexity of at least one of the direct summands and its underlying algebraic structure. We also briefly survey some previous results concerning the complexity and structure of minimal algorithms for various direct sum systems. © 1984.
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
John S. Lew
Mathematical Biosciences