Interactive function computation via polar coding
From MaRDI portal
Abstract: In a series of papers N. Ma and P. Ishwar (2011-13) considered a range of distributed source coding problems that arise in the context of iterative computation of functions, characterizing the region of achievable communication rates. We consider the problems of interactive computation of functions by two terminals and interactive computation in a collocated network, showing that the rate regions for both these problems can be achieved using several rounds of polar-coded transmissions.
Recommendations
Cites work
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- Coding for computing
- Comments on ``The generalizing Riccati equation mapping method in nonlinear evolution equation: application to \((2 + 1)\)-dimensional Boiti-Leon-Pempinelle equation
- Computation Over Multiple-Access Channels
- Elements of Information Theory
- How to Construct Polar Codes
- How to encode the modulo-two sum of binary sources (Corresp.)
- Information Theoretic Bounds for Distributed Computation Over Networks of Point-to-Point Channels
- Interactive Source Coding for Function Computation in Collocated Networks
- Polar Codes are Optimal for Lossy Source Coding
- Polar Codes for $q$-Ary Channels, $q=2^{r}$
- Polar Coding Without Alphabet Extension for Asymmetric Models
- Secure Computation from Random Error Correcting Codes
- Some Results on Distributed Source Coding for Interactive Function Computation
- The Infinite-Message Limit of Two-Terminal Interactive Source Coding
- Towards coding for maximum errors in interactive communication
- When Is a Function Securely Computable?
This page was built for publication: Interactive function computation via polar coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522930)
