Conference paper
Channel coding considerations for wireless LANs
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
Paper
A search procedure and lower bound for odd perfect numbers
Abstract
An infinite tree-generating “q-algorithm” is defined, which if executed would enumerate all odd perfect numbers (opn’s). A truncated execution shows that any opn has either some component pa > 1018, with a even, or no divisor < 7; hence any opn must be > 1036. © 1973, American Mathematical Society.
Related
Conference paper
True 3-D displays for avionics and mission crewstations
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences