Error Exponent for Multiple Access Channels: Upper Bounds

DOI10.1109/TIT.2015.2424959zbMATH Open1359.94920arXiv1010.1303OpenAlexW4254139672MaRDI QIDQ2977360

Author name not available (Why is that?)

Publication date: 28 April 2017

Published in: (Search for Journal in Brave)

Abstract: A unified framework to obtain all known lower bounds (random coding, typical random coding and expurgated bound) on the reliability function of a point-to-point discrete memoryless channel (DMC) is presented. By using a similar idea for a two-user discrete memoryless (DM) multiple-access channel (MAC), three lower bounds on the reliability function are derived. The first one (random coding) is identical to the best known lower bound on the reliability function of DM-MAC. It is shown that the random coding bound is the performance of the average code in the constant composition code ensemble. The second bound (Typical random coding) is the typical performance of the constant composition code ensemble. To derive the third bound (expurgated), we eliminate some of the codewords from the codebook with larger rate. This is the first bound of this type that explicitly uses the method of expurgation for MACs. It is shown that the exponent of the typical random coding and the expurgated bounds are greater than or equal to the exponent of the known random coding bounds for all rate pairs. Moreover, an example is given where the exponent of the expurgated bound is strictly larger. All these bounds can be universally obtained for all discrete memoryless MACs with given input and output alphabets.

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

Mathematics Subject Classification ID

No records found.

This page was built for publication: Error Exponent for Multiple Access Channels: Upper Bounds

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