Fetching the paper…
Reading the bibliography…
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm.
C. E. Shannon, “Coding theorems for a discrete source with a fidelity criterion,” IRE Nat. Conv. Rec., pt. 4 , vol. 27, pp. 142–163, 1959
1959
Earlier work this paper cites.
T. J. Goblick, Jr., “Coding for discrete information source with a distortion measure,” Ph.D. dissertation, MIT, 1962
1962
Earlier work this paper cites.
T. Berger, Rate Distortion Theory . London: Prentice Hall, 1971
1971
Earlier work this paper cites.
D. Slepian and J. Wolf, “Noiseless coding of correlated information sources,” IEEE Transactions on Information Theory , vol. 19, no. 4, pp. 471–480, 1973
1973
Earlier work this paper cites.
A. D. Wyner, “A theorem on the entropy of certain binary sequences and applications: Part II,” IEEE Trans. Inform. Theory , vol. 19, no. 6, pp. 772–777, Nov. 1973
1973
Earlier work this paper cites.
A. J. Viterbi and J. K. Omura, “Trellis encoding of memoryless disctre-time sources with a fidelity criterion,” IEEE Transactions on Information Theory , vol. 20, no. 3, pp. 325–332, 1974
1974
Earlier work this paper cites.
B. S. Tsybakov, “Defect and error correction,” Problemy Peredachi Informatsii , vol. 11, pp. 21–30, Jul.-Sep. 1975
1975
Earlier work this paper cites.
A. Wyner and J. Ziv, “The rate-distortion function for source coding with side information at the decoder,” IEEE Transactions on Information Theory , vol. 22, no. 1, pp. 1–10, 1976
1976
Earlier work this paper cites.
S. I. Gelfand and M. S. Pinsker, “Coding for channel with random parameters,” Problemy Peredachi Informatsii , vol. 9(1), pp. 19–31, 1983
1983
Earlier work this paper cites.
C. Heegard and A. A. E. Gamal, “On the capacity of computer memory with defects,” IEEE Transactions on Information Theory , vol. 29, no. 5, pp. 731–739, 1983
1983
Earlier work this paper cites.
T. M. Cover and J. A. Thomas, Elements of Information Theory . New York: Wiley, 1991
1991
Earlier work this paper cites.
G. D. Forney, Jr., “Codes on graphs: Normal realizations,” IEEE Trans. Inform. Theory , vol. 47, no. 2, pp. 520–548, Feb. 2001
2001
Earlier work this paper cites.
J. Chou, S. S. Pradhan, and K. Ramachandran, “Turbo coded trellis-based constructions for data embedding: Channel coding with side information,” in Proceedings of the Asilomar Conference , Nov. 2001, pp. 305–309
2001
Cited alongside, same era.
R. Zamir, S. Shamai, and U. Erez, “Nested linear/lattice codes for structured multiterminal binning,” IEEE Transactions on Information Theory , vol. 48, no. 6, pp. 1250–1216, 2002
2002
Cited alongside, same era.
Y. Matsunaga and H. Yamamoto, “A coding theorem for lossy data compression by ldpc codes,” IEEE Trans. Inform. Theory , vol. 49, no. 9, pp. 2225–2229, 2003
2003
Cited alongside, same era.
E. Martinian and J. Yedidia, “Iterative quantization using codes on graphs,” in Proc. of the Allerton Conf. on Commun., Control, and Computing , Monticello, IL, USA, 2003
2003
Cited alongside, same era.
U. Erez and S. ten Brink, “A close-to-capacity dirty paper coding scheme,” IEEE Transactions on Information Theory , vol. 51, no. 10, pp. 3417–3432, 2005
2005
Later among the works it cites.
Y. Sun, A. D. Liveris, V. Stankovic, and Z. Xiong, “Near-capacity dirty-paper code designs based on tcq and ira codes,” in Proc. of the IEEE Int. Symposium on Inform. Theory , Sept. 2005, pp. 184–188
2005
Later among the works it cites.
S. Ciliberti and M. Mézard, “The theoretical capacity of the parity source coder,” Journal of Statistical Mechanics:Theory and Experiment , vol. 1, no. 10003, 2005
2005
Later among the works it cites.
T. Filler and J. Fridrich, “Binary quantization using belief propagation with decimation over factor graphs of LDGM codes,” in Proc. of the Allerton Conf. on Commun., Control, and Computing , Monticello, IL, USA, 2007
2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Chou, S. S. Pradhan, and K. Ramachandran, “Turbo and trellis-based constructions for source coding with side information,” in Data Compression Conference , Mar. 2003
2003
Cited alongside, same era.
S. S. Pradhan and K. Ramchandran, “Distributed source coding using syndromes (discus): design and construction,” IEEE Transactions on Information Theory , vol. 49, no. 3, pp. 626–643, 2003
2003
Cited alongside, same era.
A. D. Liveris, Z. Xiong, and C. N. Georghiades, “Nested convolutional/turbo codes for the binary wyner-ziv problem,” in Proceedings of the International Conference on Image Processing , Sept. 2003, pp. 601–604
2003
Cited alongside, same era.
R. J. Barron, B. Chen, and G. W. Wornell, “The duality between information embedding and source coding with side information and some applications,” IEEE Trans. Inform. Theory , vol. 49, no. 5, pp. 1159–1180, 2003
2003
Cited alongside, same era.
T. Murayama, “Thouless-anderson-palmer approach for lossy compression,” J. Phys. Rev. E: Stat. Nonlin. Soft Matter Phys. , vol. 69, 2004
2004
Cited alongside, same era.
I. Dumer, “Recursive decoding and its performance for low-rate reed-muller codes,” IEEE Transactions on Information Theory , vol. 50, no. 5, pp. 811–823, 2004
2004
Cited alongside, same era.
S. Ciliberti, M. Mézard, and R. Zecchina, “Lossy data compression with random gates,” Physical Rev. Lett. , vol. 95, no. 038701, 2005
2005
Cited alongside, same era.
M. J. Wainwright and E. Maneva, “Lossy source coding via message-passing and decimation over generalized codewords of LDGM codes,” in Proc. of the IEEE Int. Symposium on Inform. Theory , Adelaide, Australia, Sept. 2005, pp. 1493–1497
2005
Cited alongside, same era.
A. Montanari, F. Ricci-Tersenghi, and G. Semerjian, “Solving constraint satisfaction problems through belief propagation-guided decimation,” in Proc. of the Allerton Conf. on Commun., Control, and Computing , Monticello, USA, Sep 26–Sep 28 2007
2007
Later among the works it cites.
A. Gupta, S. Verdú, and T. Weissman, “Rate-distortion in near-linear time,” in Proc. of the IEEE Int. Symposium on Inform. Theory , Toronto, Canada, July 6 - July 11 2008, pp. 847–851
2008
Later among the works it cites.
E. Arıkan, “Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,” submitted to IEEE Trans. Inform. Theory , 2008
2008
Later among the works it cites.
2008
Later among the works it cites.
Y. Yang, V. Stankovic, Z. Xiong, and W. Zhao, “On multiterminal source code design,” IEEE Transactions on Information Theory , vol. 54, no. 5, pp. 2278–2302, 2008
2008
Later among the works it cites.
M. J. Wainwright and E. Martinian, “Low-density graph codes that are optimal for source/channel coding and binning,” IEEE Trans. Inform. Theory , 2009
2009
Closest in time.
N. Hussami, S. B. Korada, and R. Urbanke, “Polar codes for channel and source coding,” in sumitted to ISIT , 2009
2009
Closest in time.
S. B. Korada, E. Şaşoğlu, and R. Urbanke, “Polar codes: Characterization of exponent, bounds, and constructions,” submitted to IEEE Trans. Inform. Theory , 2009
2009
Closest in time.