Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:1403.4583 (cs)
[Submitted on 18 Mar 2014 (v1), last revised 13 Jan 2015 (this version, v2)]

Title:An Achievable rate region for the $3-$user interference channel based on coset codes

Authors:Arun Padakandla, Aria G. Sahebi, S. Sandeep Pradhan
View PDF
Abstract:We consider the problem of communication over a three user discrete memoryless interference channel ($3-$IC). The current known coding techniques for communicating over an arbitrary $3-$IC are based on message splitting, superposition coding and binning using independent and identically distributed (iid) random codebooks. In this work, we propose a new ensemble of codes - partitioned coset codes (PCC) - that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit algebraic closure property of PCC to enable efficient communication over $3-$IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete $3-$IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, and moreover, strictly larger than current known largest achievable rate regions based on iid random codebooks.
Comments: New examples for which coset codes yield strictly larger achievable rate regions in comparison to those achievable using unstructured iid codes are identified. The issue of aligning interference at multiple receiver terminals addressed through an example. Revised submission to IEEE Trans. on Information Theory
Subjects: Information Theory (cs.IT)
Cite as: arXiv:1403.4583 [cs.IT]
  (or arXiv:1403.4583v2 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1403.4583
Journal reference: 10.1109/TIT.2016.2518171
Related DOI: https://doi.org/10.1109/TIT.2016.2518171

Submission history

From: Arun Padakandla [view email]
[v1] Tue, 18 Mar 2014 19:33:00 UTC (486 KB)
[v2] Tue, 13 Jan 2015 04:42:25 UTC (565 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2014-03
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Arun Padakandla
Aria Ghasemian Sahebi
S. Sandeep Pradhan
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)