Conference paper
Channel coding considerations for wireless LANs
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
Paper
Cropped cubes
Abstract
We study certain generalized covering polytopes that we call "cropped cubes". These polytopes generalize the clipped cubes which Coppersmith and Lee used to study the nondyadic indivisibility polytopes. Our main results are (i) a totally dual integral inequality description of the cropped cubes, and (ii) an efficient separation procedure.
Related
Charles Micchelli
Journal of Approximation Theory
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992