Fetching the paper…
Reading the bibliography…
The training complexity of deep learning-based channel decoders scales exponentially with the codebook size and therefore with the number of information bits.
R. Gallager, “Low-density parity-check codes,” IEEE Trans. Inform. Theory , vol. 8, no. 1, pp. 21–28, January 1962
1962
Earlier work this paper cites.
D. E. Rumelhart, G. E. Hinton, and R. J. Williams, “Parallel distributed processing: Explorations in the microstructure of cognition, vol. 1.” Cambridge, MA, USA: MIT Press, 1986, ch. Learning Internal Representations by Error Propagation, pp. 318–362
1986
Earlier work this paper cites.
K. Hornik, M. Stinchcombe, and H. White, “Multilayer feedforward networks are universal approximators,” Neural Networks , vol. 2, no. 5, pp. 359–366, 1989
1989
Earlier work this paper cites.
X.-A. Wang and S. B. Wicker, “An artificial neural net Viterbi decoder,” IEEE Trans. Commun. , vol. 44, no. 2, pp. 165–171, Feb. 1996
1996
Earlier work this paper cites.
E. Arıkan, “Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,” IEEE Trans. Inform. Theory , vol. 55, no. 7, pp. 3051–3073, July 2009
2009
Earlier work this paper cites.
J. S. Bergstra, R. Bardenet, Y. Bengio, and B. Kégl, “Algorithms for hyper-parameter optimization,” in Advances in Neural Information Processing Systems 24 . Curran Associates, Inc., 2011, pp. 2546–2554
2011
Earlier work this paper cites.
2013
Earlier work this paper cites.
J. Guo, M. Qin, A. G. i Fabregas, and P. H. Siegel, “Enhanced belief propagation decoding of polar codes through concatenation,” in 2014 IEEE Internat. Symp. Inf. Theory , June 2014, pp. 2987–2991
2014
Cited alongside, same era.
J. Xu, T. Che, and G. Choi, “XJ-BP: Express journey belief propagation decoding for polar codes,” in IEEE Global Communications Conference (GLOBECOM) , Dec 2014, pp. 1–6
2014
Cited alongside, same era.
I. Tal and A. Vardy, “List decoding of polar codes,” IEEE Trans. Inform. Theory , vol. 61, no. 5, pp. 2213–2226, May 2015
2015
Cited alongside, same era.
2016
Cited alongside, same era.
E. Nachmani, Y. Be’ery, and D. Burshtein, “Learning to decode linear codes using deep learning,” Proc. of the Allerton Conf. on Commun., Control, and Computing , 2016
2016
Later among the works it cites.
S. A. Hashemi, A. Balatsoukas-Stimming, P. Giard, C. Thibeault, and W. J. Gross, “Partitioned successive-cancellation list decoding of polar codes,” in 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , March 2016, pp. 957–960
2016
Later among the works it cites.
G. Sarkis, P. Giard, A. Vardy, C. Thibeault, and W. J. Gross, “Fast list decoders for polar codes,” IEEE Journal on Selected Areas in Communications , vol. 34, no. 2, pp. 318–328, Feb 2016
2016
Later among the works it cites.
I. Goodfellow, Y. Bengio, and A. Courville, “Deep Learning,” 2016, book in preparation for MIT Press. [Online]. Available: http://www.deeplearningbook.org
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Giard, G. Sarkis, A. Balatsoukas-Stimming, Y. Fan, C. y. Tsui, A. Burg, C. Thibeault, and W. J. Gross, “Hardware decoders for polar codes: An overview,” in 2016 IEEE International Symposium on Circuits and Systems (ISCAS) , May 2016, pp. 149–152
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2016
Cited alongside, same era.
“RAN1 meeting #87,” http://www.3gpp.org/DynaReport/TDocExMtg–R1-87–31665.htm, accessed: 2017-01-09
2017
Closest in time.
S. Cammerer, B. Leible, M. Stahl, J. Hoydis, and S. ten Brink, “Combining belief propagation and successive cancellation list decoding of polar codes on a GPU platform,” in accepted for 42th Int. Conf. on Acoustics, Speech, and Signal Processing (ICASSP) , 2017
2017
Closest in time.
T. Gruber, S. Cammerer, J. Hoydis, and S. ten Brink, “On deep learning-based channel decoding,” in Proc. of CISS , March 2017
2017
Closest in time.