Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 117216 results
Sort by: relevance publication year

Multiple-access channels with memory with and without frame synchronism

JOURNAL ARTICLE published May 1989 in IEEE Transactions on Information Theory

Authors: S. Verdu

Linear multiuser detectors for synchronous code-division multiple-access channels

JOURNAL ARTICLE published 1989 in IEEE Transactions on Information Theory

Authors: R. Lupas | S. Verdu

The capacity region of the symbol-asynchronous Gaussian multiple-access channel

JOURNAL ARTICLE published July 1989 in IEEE Transactions on Information Theory

Authors: S. Verdu

Multiple-access channels with point-process observations: Optimum demodulation

JOURNAL ARTICLE published September 1986 in IEEE Transactions on Information Theory

Authors: S. Verdu

Minimum probability of error for asynchronous Gaussian multiple-access channels

JOURNAL ARTICLE published January 1986 in IEEE Transactions on Information Theory

Authors: S. Verdu

Frequency-hopping codes for multiple-access channels: a geometric approach

JOURNAL ARTICLE published March 1989 in IEEE Transactions on Information Theory

Authors: D.B. Jevtic | H.S. Alkhatib

Variable-Rate Coding for Slowly Fading Gaussian Multiple-Access Channels

JOURNAL ARTICLE published October 2004 in IEEE Transactions on Information Theory

Authors: G. Caire | D. Tuninetti | S. Verdu

Error Exponents for Asynchronous Multiple Access Channels, Controlled Asynchronism May Outperform Synchronism

JOURNAL ARTICLE published December 2021 in IEEE Transactions on Information Theory

Research funded by National Research, Development and Innovation Office (NKFIH K105840,K120706,KH129601)

Authors: Imre Csiszar | Lorant Farkas | Tamas Koi

The effect of asynchronism on the total capacity of Gaussian multiple-access channels

JOURNAL ARTICLE published 1992 in IEEE Transactions on Information Theory

Authors: R.S. Cheng | S. Verdu

Capacity of Cognitive Interference Channels With and Without Secrecy

JOURNAL ARTICLE published February 2009 in IEEE Transactions on Information Theory

Authors: A. Somekh-Baruch | H.V. Poor | S. Shamai | S. Verdu

Splitting algorithms in noisy channels with memory

JOURNAL ARTICLE published 1989 in IEEE Transactions on Information Theory

Authors: I. Kessler | M. Sidi

Completely asynchronous multiple-access channels

PROCEEDINGS ARTICLE published in IEEE/CAM Information Theory Workshop at Cornell

Authors: S. Verdu

Identification via channels

JOURNAL ARTICLE published 1989 in IEEE Transactions on Information Theory

Authors: R. Ahlswede | G. Dueck

Error bounds in noisy channels without memory

JOURNAL ARTICLE published September 1955 in IEEE Transactions on Information Theory

Authors: A. Feinstein

Sequential decoding for multiple access channels

JOURNAL ARTICLE published March 1988 in IEEE Transactions on Information Theory

Authors: E. Arikan

Computation Over Multiple-Access Channels

JOURNAL ARTICLE published October 2007 in IEEE Transactions on Information Theory

Authors: B.. Nazer | M.. Gastpar

Robust coding for multiple-access channels

JOURNAL ARTICLE published July 1986 in IEEE Transactions on Information Theory

Authors: E. Geraniotis

Universal coding for multiple access channels

JOURNAL ARTICLE published November 1981 in IEEE Transactions on Information Theory

Authors: M. Ohkubo

Multiple access channels (Ph.D. Thesis abstr.)

JOURNAL ARTICLE published March 1973 in IEEE Transactions on Information Theory

Authors: H. Liao

On multiple access channels with feedback (Corresp.)

JOURNAL ARTICLE published November 1984 in IEEE Transactions on Information Theory

Authors: F. Willems