Coding With Side Information for Rate-Constrained Consensus
From MaRDI portal
Publication:4569043
DOI10.1109/TSP.2008.919636zbMATH Open1390.94710OpenAlexW2137505594MaRDI QIDQ4569043FDOQ4569043
Authors: Mehmet Ercan Yildiz, Anna Scaglione
Publication date: 27 June 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsp.2008.919636
Cited In (8)
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- Side-Information Scalable Source Coding
- An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms
- Fixed-rate encoding of individual sequences with side information
- Performance analysis of averaging based distributed estimation algorithm with additive quantization model
- Stochastic consensus over noisy networks with Markovian and arbitrary switches
- Distributed Estimation and Coding: A Sequential Framework Based on a Side-Informed Decomposition
- Derivative-free alternating projection algorithms for general nonconvex-concave minimax problems
This page was built for publication: Coding With Side Information for Rate-Constrained Consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569043)