Homologous codes for multiple access channels

@article{Sen2017HomologousCF,
  title={Homologous codes for multiple access channels},
  author={Pinar Sen and Young-Han Kim},
  journal={2017 IEEE International Symposium on Information Theory (ISIT)},
  year={2017},
  pages={874-878}
}
  • P. SenYoung-Han Kim
  • Published 1 June 2017
  • Computer Science
  • 2017 IEEE International Symposium on Information Theory (ISIT)
Building on recent development by Padakandla and Pradhan, and by Lim, Feng, Pastore, Nazer, and Gastpar, this paper studies the potential of structured coding as a complete replacement for random coding in network information theory. The roles of two techniques used in nested coset coding to generate nonuniform codewords, namely, shaping and channel transformation, are clarified and illustrated via the simple example of the two-sender multiple access channel. While individually deficient, the… 

Figures from this paper

Homologous Codes for Multiple Access Channels

The roles of two techniques used in coset coding to generate nonuniform codewords, namely, shaping and channel transformation, are clarified and illustrated via the simple example of the two-sender multiple access channel.

Optimal Achievable Rates for Computation With Random Homologous Codes

An outer bound on the optimal rate region for the computation problem when the encoding strategy is restricted to random ensembles of homologous codes, namely, structured nested coset codes from the same generator matrix and individual shaping functions based on joint typicality encoding is presented.

Towards an algebraic network information theory: Simultaneous joint typicality decoding

This paper considers the problem of recovering K linearly independent combinations over a K-user MAC, i.e., recovering the messages in their entirety via nested linear codes, to handle the statistical dependencies between competing codeword K-tuples that occur in nested linear code ensembles.

On the Optimal Achievable Rates for Linear Computation With Random Homologous Codes

Most, if not all, coding schemes for computation in the literature that rely on random construction of nested coset codes cannot be improved by using more powerful decoders such as the maximum likelihood decoder, according to this result.

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

This work proposes an achievable rate region for simultaneous joint typicality decoding of nested linear codes and generalizes the results of Körner and Marton to computing an arbitrary number of linear combinations and to the lossy computation setting.

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

Bounds for simultaneous joint typicality decoding used in conjunction with nested linear codebooks are developed and applied to obtain a larger achievable region for compute–forward over a discrete memoryless MAC.

Lattices from Linear Codes: Source and Channel Networks

  • F. ShiraniS. Pradhan
  • Computer Science
    2022 IEEE International Symposium on Information Theory (ISIT)
  • 2022
A general framework is presented which involves fine discretization of the source and channel variables followed by communication over the resulting discretized network and convergence results for information measures are provided.

An Algebraic and Probabilistic Framework for Network Information Theory

This monograph develops a mathematical framework based on asymptotically good random structured codes, i.e., codes possessing algebraic properties, for network information theory that is applicable to arbitrary instances of the multi-terminal communication problems under consideration.

References

SHOWING 1-10 OF 27 REFERENCES

Optimal Achievable Rates for Computation With Random Homologous Codes

An outer bound on the optimal rate region for the computation problem when the encoding strategy is restricted to random ensembles of homologous codes, namely, structured nested coset codes from the same generator matrix and individual shaping functions based on joint typicality encoding is presented.

An Achievable Rate Region Based on Coset Codes for Multiple Access Channel With States

We prove that the ensemble of the nested coset codes built on finite fields achieves the capacity of arbitrary discrete memoryless point-to-point channels. Exploiting its algebraic structure, we

Towards an algebraic network information theory: Simultaneous joint typicality decoding

This paper considers the problem of recovering K linearly independent combinations over a K-user MAC, i.e., recovering the messages in their entirety via nested linear codes, to handle the statistical dependencies between competing codeword K-tuples that occur in nested linear code ensembles.

A Joint Typicality Approach to Algebraic Network Information Theory

A joint typicality framework for encoding and decoding nested linear codes for multi-user networks is presented, which establishes an achievable rate region for computing the weighted sum of nested linear codewords over a discrete memoryless multiple-access channel (MAC).

Compute-and-Forward: Harnessing Interference Through Structured Codes

This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network and is applicable even if the transmitters lack channel state information.

Communication Versus Computation: Duality for Multiple-Access Channels and Source Coding

For any code that is known to be a good computation code for some MAC, a class of MACs for which that code cannot enable full message decoding is characterized, and an analogous duality result is established for a related DSC problem.

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

This paper develops coding techniques that exploit the algebraic closure property of PCC to enable interference alignment over general 3-IC and analyzes the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3- IC.

Lattice Codes for the Gaussian Relay Channel: Decode-and-Forward and Compress-and-Forward

The results suggest that structured/lattice codes may be used to mimic, and sometimes outperform, random Gaussian codes in general Gaussian networks.

Multilevel Coding Schemes for Compute-and-Forward With Flexible Decoding

Numerical results demonstrate that the flexibility afforded by the proposed scheme results in substantially higher rates than those achievable by always using a fixed function or considering only linear functions over higher order fields.

The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel

A new framework for lattice interference alignment, based on the compute-and-forward approach is developed, which shows that decoding linear combinations of the codewords can approach the sum capacity of the Gaussian multiple-access channel up to a gap of no more than ${K}/{2}\log{K}$ bits.