Towards an algebraic network information theory: Simultaneous joint typicality decoding

@article{Lim2017TowardsAA,
  title={Towards an algebraic network information theory: Simultaneous joint typicality decoding},
  author={Sung Hoon Lim and Chen Feng and Adriano Pastore and Bobak Nazer and Michael Gastpar},
  journal={2017 IEEE International Symposium on Information Theory (ISIT)},
  year={2017},
  pages={1818-1822}
}
  • Sung Hoon Lim, Chen Feng, +2 authors Michael Gastpar
  • Published in
    IEEE International Symposium…
    2017
  • Computer Science, Mathematics
  • Recent work has employed joint typicality encoding and decoding of nested linear code ensembles to generalize the compute-forward strategy to discrete memoryless multiple-access channels (MACs). An appealing feature of these nested linear code ensembles is that the coding strategies and error probability bounds are conceptually similar to classical techniques for random i.i.d. code ensembles. In this paper, we consider the problem of recovering K linearly independent combinations over a K-user… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Citations

    Publications citing this paper.
    SHOWING 1-5 OF 5 CITATIONS

    Homologous codes for multiple access channels

    • Pinar Sen, Young-Han Kim
    • Mathematics, Computer Science
    • 2017 IEEE International Symposium on Information Theory (ISIT)
    • 2017
    VIEW 9 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Optimal Achievable Rates for Computation With Random Homologous Codes

    VIEW 6 EXCERPTS
    CITES BACKGROUND & METHODS

    Homologous Codes for Multiple Access Channels

    Towards an Algebraic Network Information Theory: Distributed Lossy Computation of Linear Functions

    VIEW 1 EXCERPT
    CITES METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 51 REFERENCES

    An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Compute-and-Forward: Harnessing Interference Through Structured Codes

    VIEW 11 EXCERPTS

    Capacity theorems for the relay channel

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    A Joint Typicality Approach to Compute–Forward

    VIEW 2 EXCERPTS

    Equivalence of Additive-Combinatorial Linear Inequalities for Shannon Entropy and Differential Entropy

    VIEW 1 EXCERPT

    Optimal Achievable Rates for Computation With Random Homologous Codes

    VIEW 1 EXCERPT

    Unified compute–forward rates for discrete and continuous input distributions

    • A. Pastore, S. H. Lim, C. Feng, B. Nazer, M. Gastpar
    • 2018, in preparation. January 11, 2019 DRAFT
    • 2018
    VIEW 1 EXCERPT

    Gaussian Multiple Access via Compute-and-Forward

    VIEW 1 EXCERPT

    Homologous codes for multiple access channels

    • Pinar Sen, Young-Han Kim
    • Mathematics, Computer Science
    • 2017 IEEE International Symposium on Information Theory (ISIT)
    • 2017
    VIEW 1 EXCERPT