Facet browsing currently unavailable
Page 3 of 112738 results
Sort by: relevance publication year
The discrete memoryless multiple access channel with partially cooperating encoders (Corresp.) JOURNAL ARTICLE published May 1983 in IEEE Transactions on Information Theory |
Optimal detection of discrete Markov sources over discrete memoryless channels-applications to combined source-channel coding JOURNAL ARTICLE published 1994 in IEEE Transactions on Information Theory |
Analytical and Numerical Characterizations of Shannon Ordering for Discrete Memoryless Channels JOURNAL ARTICLE published January 2014 in IEEE Transactions on Information Theory |
Construction of Polar Codes for Arbitrary Discrete Memoryless Channels JOURNAL ARTICLE published January 2018 in IEEE Transactions on Information Theory Research funded by NSF (CCF1217245,CCF1217894,CCF1422955) | NSF (CCF1217894,CCF1422955) | NSF (CF1217245,CCF1217894,CCF1422955,CCF1618603) |
A low-rate bound on the reliability of a quantum discrete memoryless channel JOURNAL ARTICLE published December 2002 in IEEE Transactions on Information Theory |
A construction of codes with exponential error bounds on arbitrary discrete memoryless channels JOURNAL ARTICLE published May 1997 in IEEE Transactions on Information Theory |
The discrete memoryless multiple-access channel with cribbing encoders JOURNAL ARTICLE published May 1985 in IEEE Transactions on Information Theory |
Asynchronous Slepian-Wolf coding via source-splitting PROCEEDINGS ARTICLE published in Proceedings of IEEE International Symposium on Information Theory |
A note on the Arimoto- Blahut algorithm for computing the capacity of discrete memoryless channels (Corresp.) JOURNAL ARTICLE published March 1984 in IEEE Transactions on Information Theory |
Performance bounds for high rate linear codes over partial-response channels JOURNAL ARTICLE published March 2001 in IEEE Transactions on Information Theory |
The capacity of low-density parity-check codes under message-passing decoding JOURNAL ARTICLE published 2001 in IEEE Transactions on Information Theory |
Multiple repetition feedback coding for discrete memoryless channels PROCEEDINGS ARTICLE published in Proceedings of 1995 IEEE International Symposium on Information Theory |
Optimal Ultrasmall Block-Codes for Binary Discrete Memoryless Channels JOURNAL ARTICLE published November 2013 in IEEE Transactions on Information Theory |
Asymptotically optimal water-filling in vector multiple-access channels JOURNAL ARTICLE published 2001 in IEEE Transactions on Information Theory |
Limiting performance of block-fading channels with multiple antennas JOURNAL ARTICLE published May 2001 in IEEE Transactions on Information Theory |
Correction to “Multiple-Antenna Signal Constellations for Fading Channels” JOURNAL ARTICLE published January 2007 in IEEE Transactions on Information Theory |
Partial feedback for the discrete memoryless multiple access channel (Corresp.) JOURNAL ARTICLE published March 1983 in IEEE Transactions on Information Theory |
The iterative turbo decoding algorithm has fixed points JOURNAL ARTICLE published 2001 in IEEE Transactions on Information Theory |
Correlation functions and reconstruction error for quantized Gaussian signals transmitted over discrete memoryless channels (Corresp.) JOURNAL ARTICLE published July 1972 in IEEE Transactions on Information Theory |
Design of capacity-approaching irregular low-density parity-check codes JOURNAL ARTICLE published 2001 in IEEE Transactions on Information Theory |