Performance of Polar Codes for Channel and Source Coding

E. Weiss, “Compression and coding,” IRE Trans. Inform. Theory , pp. 256–257, 1962

1962

Earlier work this paper cites.

P. E. Allard and E. W. Bridgewater, “A source encoding technique using algebraic codes,” June 1972, pp. 201–203

1972

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.

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

Earlier work this paper cites.

U. Erez and R. Zamir, “Bounds on the ϵ \epsilon -covering radius of linear codes with applications to self noise in nested Wyner-Ziv coding,” Feb. 2002, dept. Elec. Eng-Syst., Tel-Aviv Univ., Tech. Rep

Original

2002

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.

M. Schwartz and A. Vardy, “On the stopping distance and the stopping redundancy of codes,” IEEE Trans. Inform. Theory , vol. 52, no. 3, pp. 922 – 932, Mar. 2006

2006

Cited alongside, same era.

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.

E. Arıkan and E. Telatar, “On the rate of channel polarization,” July 2008, available from “http://arxiv.org/pdf/0807.3917”

Original

2008

Later among the works it cites.

E. Arıkan, “A performance comparison of Polar codes and Reed-Muller codes,” IEEE Communications Letters , vol. 12, no. 6, 2008

2008

Later among the works it cites.