Error Performance of Channel Coding in Random-Access Communication
From MaRDI portal
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.
Cited in
(12)- Error performance of mismatched receivers for linear-coded modulation
- Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels
- Moderate Deviations in Channel Coding
- Error Probabilities for Spread-Spectrum Packet Radio with Convolutional Codes and Viterbi Decoding
- scientific article; zbMATH DE number 3470272 (Why is no real title available?)
- Estimation d'erreurs dans un problème de transmission
- scientific article; zbMATH DE number 1145665 (Why is no real title available?)
- Evaluation of the performance of error-correcting codes on a Gilbert channel
- Error Event Characterization on 2-D ISI Channels
- 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
- Improving the compression rate versus \(L^{1}\) error ratio in cell-average error control algorithms
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)