Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
40
click to vote
INFOCOM
1989
IEEE
102
views
Communications
»
more
INFOCOM 1989
»
An Efficient Multiple-Access Method for the Binary Adder Channel
14 years 3 months ago
Download
webee.technion.ac.il
Consider M - HChoose P - T communications: T users or less, out of M potential users, are chosen at random to simultaneously transmit binary data over a common channel. A method f...
Israel Bar-David, Eli Plotnik, Raphael Rom
claim paper
Read More »
16
click to vote
INFOCOM
1989
IEEE
50
views
Communications
»
more
INFOCOM 1989
»
Random Access Systems with a Time Varying Channel
14 years 3 months ago
Download
cwc.ucsd.edu
Kelvin K. Y. Ho, Ramesh R. Rao, Jack K. Wolf
claim paper
Read More »
18
click to vote
INFOCOM
1989
IEEE
51
views
Communications
»
more
INFOCOM 1989
»
Delay Analysis of an Asymmetric, Buffered Random Access System
14 years 3 months ago
Download
cwc.ucsd.edu
Amir Behroozi-Toosi, Ramesh R. Rao
claim paper
Read More »