Skip to content
DraconiticResearch
Search Sources API
186,086 studies31 sourcesUpdated 32 min ago
PreprintCC BY 4.0arXiv

An Improved Upper Bound on the Capacity of the Primitive Diamond Relay Channel

  • Deniz Gündüz
  • Yanxiao Liu
  • Yi Liu
Open at sourcePDFDOICite

Abstract

We study the capacity of the primitive diamond relay channel and derive an improved upper bound compared with existing upper bounds by employing the Csiszár--Körner--Marton sum identity and Gallager-type identification. For Gaussian primitive diamond relay channels, we show that our proposed bound coincides with the existing strengthened Gaussian upper bound of Wu, Özgür, Peleg, and Shamai. For discrete memoryless channels, our bound can be strictly tighter than both the cut-set bound and the existing upper bound, and we assess the improvement using different channel instances, together with a decode--forward/compress--forward time-sharing inner bound.

Related

  1. A New Upper Bound on the Binary Deletion Channel Capacity
    Özgür Soysal
    arXivPreprintCC0Full textGeneral mathematicsarXiv
  2. Improved lower bound for the two-way-assisted quantum capacity of the bosonic thermal-loss channel
    Matthew Barber, Stefano Pirandola
    arXivPreprintarXiv licenceFull textMathematical physicsComputational physicsarXiv
  3. An Improved Lower Bound on Support Size of Capacity-Achieving Inputs for the Binomial Channel: Extended version
    Mohammadamin Baniasadi, Antonino Favano, Luca Barletta +1
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  4. Improved Lower Bounds on the Capacity of the Binary Deletion Channel via a Learning Approach to Run-Length Inputs
    Hassan Khodaiemehr, Chen Feng, Tolga M. Duman
    arXivPreprintCC BY-NC-ND 4.0Full textGeneral mathematicsarXiv
  5. Improved first moments of primitive quartic and sextic Dirichlet L-functions
    Ziwei Hong
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv

Cite

BibTeXRIS
BibTeX
@misc{gunduz2026improved,
  title = {{An Improved Upper Bound on the Capacity of the Primitive Diamond Relay Channel}},
  author = {Deniz Gündüz and Yanxiao Liu and Yi Liu},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.12034},
  eprint = {2610.12034},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.12034},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - An Improved Upper Bound on the Capacity of the Primitive Diamond Relay Channel
AU  - Deniz Gündüz
AU  - Yanxiao Liu
AU  - Yi Liu
PY  - 2026
DA  - 2026/10/08
PB  - arXiv
DO  - 10.48550/arxiv.2610.12034
UR  - https://arxiv.org/abs/2610.12034
AB  - We study the capacity of the primitive diamond relay channel and derive an improved upper bound compared with existing upper bounds by employing the Csiszár--Körner--Marton sum identity and Gallager-type identification. For Gaussian primitive diamond relay channels, we show that our proposed bound coincides with the existing strengthened Gaussian upper bound of Wu, Özgür, Peleg, and Shamai. For discrete memoryless channels, our bound can be strictly tighter than both the cut-set bound and the existing upper bound, and we assess the improvement using different channel instances, together with a decode--forward/compress--forward time-sharing inner bound.
ER  -