A channel coding approach for random access communication with bursty sources

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 1823-1827

  Luo, Jie ^a   Ephremides, Anthony ^b  

^a Engineering Research Center and Hydraulics Laboratory   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABLE RATE REGION; ACHIEVABLE REGION; COLLISION DETECTION; COMMUNICATION RATE; CONVEX HULL; DISCRETE-TIME; INFORMATION-THEORETIC ANALYSIS; MEMORYLESS CHANNELS; PACKET COLLISIONS; PACKET RECOVERY; PERFORMANCE LIMITATIONS; RANDOM ACCESS; RANDOM CODING; RANDOM-ACCESS COMMUNICATIONS; SHANNON INFORMATION; UNDERFLOWS;

CHANNEL CODING; INFORMATION THEORY; SIGNAL ENCODING; TRANSMITTERS;

COMMUNICATION;

EID: 77955693299     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513410     Document Type: Conference Paper

References (11)

1. T. Cover and J. Thomas, Elements of Information Theory, 2nd Edition, Wiley Interscience, 2005.
2. R. Gallager, A Simple Derivation of The Coding Theorem and Some Applications, IEEE Transactions on Information Theory, Vol. 11, pp. 3-18, January 1965.
3. Y. Polyanskiy, V. Poor, S. Verdú, Channel Coding Rate in The Finite Blocklength Regime, submitted to IEEE Transactions on Information Theory.
4. I. Telatar and R. Gallager, Combining Queueing Theory with Information Theory for Multiaccess, IEEE Journal on Selected Areas in Communications, Vol. 13, pp. 963-969, August 1995.
5. R. Berry and R. Gallager, Communication over Fading Channels with Delay Constraints, IEEE Transactions on Information Theory, Vol. 48, pp. 11351149, May 2002.
6. A. Ephremides and B. Hajek, Information Theory and Communication Networks: An Unconsummated Union, IEEE Transactions on Information Theory, Vol. 44, pp. 2416-2434, October 1998.
7. D. Bertsekas and R. Gallager, Data Network, 2nd Edition, Prentice Hall, 1992.
8. J. Luo and A. Ephremides, On the Throughput, Capacity, and Stability Regions of Random Multiple Access, IEEE Transactions on Information Theory, Vol. 52, pp. 2593-2607, June 2006.
9. S. Shamai, I. Teletar, and S. Verdú, Fountain Capacity, IEEE Transactions on Information Theory, Vol. 53, pp. 4372-4376, November 2007.
10. J. Luo and A. Ephremides, A New Channel Coding Approach for Random Access with Bursty Traffic, submitted to IEEE Transactions on Information Theory, http://www.engr.colostate.edu/~rockey/Papers/RandomAccessCodingJournal.pdf.
11. Z. Wamg and J. Luo, Achievable Error Exponent of Channel Coding in Random Access Communication, submitted to IEEE ISIT, Austin, TX, June 2007.