RNN Decoding of Linear Block Codes

R. G. Gallager, Low Density Parity Check Codes . Cambridge, Massachusetts: M.I.T. Press, 1963

1963

Earlier work this paper cites.

M. P. Fossorier and S. Lin, “Soft-decision decoding of linear block codes based on ordered statistics,” IEEE Transactions on Information Theory , vol. 41, no. 5, pp. 1379–1396, 1995

1995

Earlier work this paper cites.

M. P. Fossorier, “Iterative reliability-based decoding of low-density parity check codes,” IEEE Journal on selected Areas in Communications , vol. 19, no. 5, pp. 908–917, 2001

2001

Earlier work this paper cites.

J. Jiang and K. R. Narayanan, “Iterative soft-input soft-output decoding of reed-solomon codes by adapting the parity-check matrix,” IEEE Transactions on Information Theory , vol. 52, no. 8, pp. 3746–3756, 2006

2006

Earlier work this paper cites.

T. R. Halford and K. M. Chugg, “Random redundant soft-in soft-out decoding of linear block codes,” in Information Theory, 2006 IEEE International Symposium on . IEEE, 2006, pp. 2230–2234

2006

Earlier work this paper cites.

T. Hehn, J. B. Huber, S. Laendner, and O. Milenkovic, “Multiple-bases belief-propagation for decoding of short block codes,” in Information Theory, 2007. ISIT 2007. IEEE International Symposium on . IEEE, 2007, pp. 311–315

2007

Earlier work this paper cites.

T. Richardson and R. Urbanke, Modern Coding Theory . Cambridge, UK: Cambridge University Press, 2008

2008

Earlier work this paper cites.

I. Dimnik and Y. Be’ery, “Improved random redundant iterative hdpc decoding,” IEEE Transactions on Communications , vol. 57, no. 7, pp. 1982–1985, 2009

2009

Earlier work this paper cites.

A. Yufit, A. Lifshitz, and Y. Be’ery, “Efficient linear programming decoding of hdpc codes,” IEEE Transactions on Communications , vol. 59, no. 3, pp. 758–766, 2011

2011

Cited alongside, same era.

X. Zhang and P. H. Siegel, “Adaptive cut generation algorithm for improved linear programming decoding of binary linear codes,” IEEE Transactions on Information Theory , vol. 58, no. 10, pp. 6581–6594, 2012

2012

Cited alongside, same era.

T. Tieleman and G. Hinton, “Lecture 6.5-rmsprop: Divide the gradient by a running average of its recent magnitude,” COURSERA: Neural Networks for Machine Learning , vol. 4, no. 2, 2012

2012

Cited alongside, same era.

A. Graves, A.-r. Mohamed, and G. Hinton, “Speech recognition with deep recurrent neural networks,” in 2013 IEEE international conference on acoustics, speech and signal processing . IEEE, 2013, pp. 6645–6649

2013

Cited alongside, same era.

E. Nachmani, Y. Beery, and D. Burshtein, “Learning to decode linear codes using deep learning,” 54’th Annual Allerton Conf. On Communication, Control and Computing, Mouticello, IL, September 2016. arXiv preprint arXiv:1607.04793 , 2016

Original

2016

Later among the works it cites.

M. Helmling and S. Scholl, “Database of channel codes and ml simulation results,” www.uni-kl.de/channel-codes, University of Kaiserslautern, 2016

2016

Later among the works it cites.

J. Van Wonterghem, A. Alloumf, J. Boutros, and M. Moeneclaey, “Performance comparison of short-length error-correcting codes,” in Communications and Vehicular Technologies (SCVT), 2016 Symposium on . IEEE, 2016, pp. 1–6

2016

Later among the works it cites.

I. Hubara, M. Courbariaux, D. Soudry, R. El-Yaniv, and Y. Bengio, “Quantized neural networks: Training neural networks with low precision weights and activations,” arXiv preprint arXiv:1609.07061 , 2016

Original

2016

Later among the works it cites.