HOW AN ERDOS-RENYI-TYPE SEARCH APPROACH GIVES AN EXPLICIT CODE CONSTRUCTION OF RATE-1 FOR RANDOM-ACCESS WITH MULTIPLICITY FEEDBACK

Citation
M. Ruszinko et P. Vanroose, HOW AN ERDOS-RENYI-TYPE SEARCH APPROACH GIVES AN EXPLICIT CODE CONSTRUCTION OF RATE-1 FOR RANDOM-ACCESS WITH MULTIPLICITY FEEDBACK, IEEE transactions on information theory, 43(1), 1997, pp. 368-373
Citations number
19
Categorie Soggetti
Information Science & Library Science","Engineering, Eletrical & Electronic
ISSN journal
00189448
Volume
43
Issue
1
Year of publication
1997
Pages
368 - 373
Database
ISI
SICI code
0018-9448(1997)43:1<368:HAESAG>2.0.ZU;2-G
Abstract
Pippenger showed in a probabilistic way that the capacity of a collisi on channel with multiplicity feedback is one. in this correspondence, using an Erdos-Renyi type search strategy, we settle a long-standing o pen problem by giving a constructive proof of this result. Moreover, w e prove that two different capacity definitions are equivalent, thereb y solving a problem posed by Tsybakov.