Achievable error exponent of channel coding in random access communication

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 270-274

  Wang, Zheng ^a   Luo, Jie ^a  

^a Department of Mechanical Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABLE REGION; CODEWORD LENGTH; CODING THEOREMS; COMMUNICATION RATE; CONVEX HULL; DECODING ERRORS; DISCRETE-TIME; ERROR EXPONENT; INFORMATION RATES; MEMORYLESS CHANNELS; MESSAGE RECOVERY; MISS DETECTION PROBABILITY; MULTIPLE ACCESS COMMUNICATIONS; RANDOM-ACCESS COMMUNICATIONS; SYSTEM ERRORS;

CHANNEL CODING; COMMUNICATION; DECODING; ERROR DETECTION; INFORMATION THEORY; SIGNAL ENCODING;

PROBABILITY;

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

References (4)

1. J. Luo, A. Ephremides "A New Channel Coding Approach for Random Access with Bursty Traffic," submitted to IEEE Trans. on Inform. Theory.
2. R. Gallager, "A Simple Derivation of The Coding Theorem and Some Applications", IEEE Trans. Inform. Theory, Vol. 11, pp. 3-18, Jan. 1965.
3. L. Weng, S. Pradhan, and A. Anastasopoulos, "Error Exponent Regions for Gaussian Broadcast and Multiple Acsess Channels," IEEE Trans. Inform. Theory, Vol. 54, pp. 2919-2942, Jul. 2008.
4. A. Montanari, G. Forney, "On Exponential Error Bounds for Random Codes on the DMC," http://www.stanford.edu/monta-nar/PAPERS/FILEPAP/dmc.ps, unpublished.