Interactive function computation via polar coding
From MaRDI portal
Publication:522930
DOI10.1134/S0032946016010063zbMath1365.94202arXiv1405.0894MaRDI QIDQ522930
Publication date: 19 April 2017
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.0894
Related Items
Cites Work
- Comments on ``The generalizing Riccati equation mapping method in nonlinear evolution equation: application to \((2 + 1)\)-dimensional Boiti-Leon-Pempinelle equation
- Polar Codes for $q$-Ary Channels, $q=2^{r}$
- Computation Over Multiple-Access Channels
- How to encode the modulo-two sum of binary sources (Corresp.)
- Coding for computing
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- Interactive Source Coding for Function Computation in Collocated Networks
- When Is a Function Securely Computable?
- Some Results on Distributed Source Coding for Interactive Function Computation
- Information Theoretic Bounds for Distributed Computation Over Networks of Point-to-Point Channels
- Polar Codes are Optimal for Lossy Source Coding
- Polar Coding Without Alphabet Extension for Asymmetric Models
- How to Construct Polar Codes
- The Infinite-Message Limit of Two-Terminal Interactive Source Coding
- Towards coding for maximum errors in interactive communication
- Secure Computation from Random Error Correcting Codes
- Elements of Information Theory
This page was built for publication: Interactive function computation via polar coding
