On the Reliability Function of the Discrete Memoryless Relay Channel
From MaRDI portal
Publication:2978662
DOI10.1109/TIT.2015.2400999zbMATH Open1359.94525arXiv1304.3553OpenAlexW3103381487MaRDI QIDQ2978662FDOQ2978662
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Bounds on the reliability function for the discrete memoryless relay channel are derived using the method of types. Two achievable error exponents are derived based on partial decode-forward and compress-forward which are well-known superposition block-Markov coding schemes. The derivations require combinations of the techniques involved in the proofs of Csisz'ar-K"orner-Marton's packing lemma for the error exponent of channel coding and Marton's type covering lemma for the error exponent of source coding with a fidelity criterion. The decode-forward error exponent is evaluated on Sato's relay channel. From this example, it is noted that to obtain the fastest possible decay in the error probability for a fixed effective coding rate, one ought to optimize the number of blocks in the block-Markov coding scheme assuming the blocklength within each block is large. An upper bound on the reliability function is also derived using ideas from Haroutunian's lower bound on the error probability for point-to-point channel coding with feedback.
Full work available at URL: https://arxiv.org/abs/1304.3553
Cited In (5)
- On the reliability exponent of the exponential timing channel
- Title not available (Why is that?)
- Reliability function of a binary symmetrical channel with feedback
- A Converse Result for the Discrete Memoryless Relay Channel With Relay–Transmitter Feedback
- Strong converse theorems for multimessage networks with tight cut-set bound
This page was built for publication: On the Reliability Function of the Discrete Memoryless Relay Channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978662)
