Error Performance of Channel Coding in Random-Access Communication

DOI10.1109/TIT.2012.2190580zbMATH Open1365.94357arXiv1010.0642MaRDI QIDQ5271925

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the rate information among each other or with the receiver. The receiver will either decode the message or report a collision depending on whether reliable message recovery is possible. It was shown that, asymptotically as the codeword length goes to infinity, the set of communication rates supporting reliable message recovery can be characterized by an achievable region which equals Shannon's information rate region possibly without a convex hull operation. In this paper, we derive achievable bounds on error probabilities, including the decoding error probability and the collision miss detection probability, of random multiple access systems with a finite codeword length. Achievable error exponents are obtained by taking the codeword length to infinity.

Full work available at URL: https://arxiv.org/abs/1010.0642

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)

Related Items (10)

On the Probability of Error Using a Repeat-Request Strategy on the Additive White Gaussian Noise Channel ⋮ Data Transmission Error Probabilities in the Presence of Low-Frequency Removal and Noise ⋮ Title not available (Why is that?) ⋮ Error Probabilities for Spread-Spectrum Packet Radio with Convolutional Codes and Viterbi Decoding ⋮ Evaluation of the performance of error-correcting codes on a Gilbert channel ⋮ Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels ⋮ Moderate Deviations in Channel Coding ⋮ Error performance of mismatched receivers for linear-coded modulation ⋮ Improving the compression rate versus \(L^{1}\) error ratio in cell-average error control algorithms ⋮ Error Event Characterization on 2-D ISI Channels

This page was built for publication: Error Performance of Channel Coding in Random-Access Communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5271925)