A study on the impact of locality in the decoding of binary cyclic codes

In this paper, we study the impact of locality on the decoding of binary cyclic codes under two approaches, namely ordered statistics decoding (OSD) and trellis decoding. Given a binary cyclic code having locality or availability, we suitably modify the OSD to obtain gains in terms of Signal-To-Noise ratio, for a given reliability and essentially the same level of decoder complexity. With regard to trellis decoding, we show that careful introduction of locality results in the creation of cyclic subcodes having lower maximum state complexity. We also present a simple upper-bounding technique on the state complexity profile, based on the zeros of the code. Finally, it is shown how the decoding speed can significantly be increased in the presence of locality, in the moderate-to-high SNR regime, by making use of a quick-look decoder that often returns the ML codeword.

[1]  L. Litwin,et al.  Error control coding , 2001 .

[2]  P. Vijay Kumar,et al.  Codes With Local Regeneration and Erasure Correction , 2014, IEEE Transactions on Information Theory.

[3]  Itzhak Tamo,et al.  A Family of Optimal Locally Recoverable Codes , 2013, IEEE Transactions on Information Theory.

[4]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[5]  Krishna R. Narayanan,et al.  Iterative Soft-Input Soft-Output Decoding of Reed-Solomon Codes by Adapting the , 2005 .

[6]  Itzhak Tamo,et al.  Locally Recoverable Codes on Algebraic Curves , 2017, IEEE Transactions on Information Theory.

[7]  Alexander Vardy,et al.  Maximum-Likelihood Soft Decision Decoding of Bch Codes , 1993, Proceedings. IEEE International Symposium on Information Theory.

[8]  P. Vijay Kumar,et al.  Codes with hierarchical locality , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[9]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[10]  R. Blahut.  Algebraic Codes for Data Transmission , 2002 .

[11]  J. Boutros,et al.  Generalized low density (Tanner) codes , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[12]  Marc P. C. Fossorier,et al.  Iterative reliability-based decoding of linear block codes with adaptive belief propagation , 2005, IEEE Communications Letters.

[13]  Robert J. McEliece,et al.  On the BCJR trellis for linear block codes , 1996, IEEE Trans. Inf. Theory.

[14]  Krishna R. Narayanan,et al.  Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix , 2005, IEEE Transactions on Information Theory.

[15]  Michael Lentmaier,et al.  On generalized low-density parity-check codes based on Hamming component codes , 1999, IEEE Communications Letters.

[16]  Marc P. C. Fossorier,et al.  Iterative reliability-based decoding of low-density parity check codes , 2001, IEEE J. Sel. Areas Commun..

[17]  Itzhak Tamo,et al.  Locally recoverable codes on algebraic curves , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[18]  A. Robert Calderbank,et al.  Cyclic LRC codes and their subfield subcodes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[19]  Itzhak Tamo,et al.  Bounds on the Parameters of Locally Recoverable Codes , 2015, IEEE Transactions on Information Theory.

[20]  Zhifang Zhang,et al.  Repair Locality With Multiple Erasure Tolerance , 2014, IEEE Transactions on Information Theory.

[21]  Shu Lin,et al.  Soft-decision decoding of linear block codes based on ordered statistics , 1994, IEEE Trans. Inf. Theory.

[22]  Jack K. Wolf,et al.  Efficient maximum likelihood decoding of linear block codes using a trellis , 1978, IEEE Trans. Inf. Theory.

[23]  Abhishek Agarwal,et al.  Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes , 2017, IEEE Transactions on Information Theory.

[24]  G. David Forney,et al.  Coset codes-II: Binary lattices and related codes , 1988, IEEE Trans. Inf. Theory.

[25]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[26]  Shu-Tao Xia,et al.  Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes , 2018, IEEE Transactions on Information Theory.

[27]  Douglas J. Muder.  Minimal trellises for block codes , 1988, IEEE Trans. Inf. Theory.

[28]  A. Robert Calderbank,et al.  Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes , 2016, Int. J. Inf. Coding Theory.

[29]  Cheng Huang,et al.  On the Locality of Codeword Symbols , 2011, IEEE Transactions on Information Theory.