List Decodability of Symbol-Pair Codes

We investigate the list decodability of symbol-pair codes<xref ref-type="fn" rid="fn1"><sup>1</sup></xref> in this paper. First, we show that the list decodability of every symbol-pair code does not exceed the Gilbert–Varshamov bound. On the other hand, we are able to prove that with high probability, a random symbol-pair code can be list decoded up to the Gilbert–Varshamov bound. Our second result of this paper is to derive the Johnson-type bound, i.e., a lower bound on list decoding radius in terms of minimum distance. Finally, we present a list decoding algorithm of Reed–Solomon codes beyond the Johnson-type bound in the pair metric.<fn id="fn1"><label><sup>1</sup></label><p>A symbol-pair code is referred to a code in the pair metric.</p></fn>

[1]  Peter Elias,et al.  List decoding for noisy channels , 1957 .

[2]  Shixin Zhu,et al.  A Construction of New MDS Symbol-Pair Codes , 2015, IEEE Transactions on Information Theory.

[3]  Simon Litsyn,et al.  Symbol-pair codes: Algebraic constructions and asymptotic bounds , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[4]  Vladimir M. Blinovsky,et al.  List decoding , 1992, Discrete Mathematics.

[5]  Yang Ding,et al.  On List-Decodability of Random Rank Metric Codes and Subspace Codes , 2014, IEEE Transactions on Information Theory.

[6]  Venkatesan Guruswami,et al.  List decoding of error correcting codes , 2001 .

[7]  Venkatesan Guruswami,et al.  List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound , 2013, STOC '13.

[8]  Antonia Wachter-Zeh,et al.  Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius , 2016, IEEE Transactions on Information Theory.

[9]  Shachar Lovett,et al.  Subspace Evasive Sets , 2011, Electron. Colloquium Comput. Complex..

[10]  Masakatu Morii,et al.  Syndrome decoding of symbol-pair codes , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[11]  Masakatu Morii,et al.  Error-trapping decoding for cyclic codes over symbol-pair read channels , 2016, 2016 International Symposium on Information Theory and Its Applications (ISITA).

[12]  Yeow Meng Chee,et al.  Maximum Distance Separable Codes for Symbol-Pair Read Channels , 2012, IEEE Transactions on Information Theory.

[13]  Venkatesan Guruswami,et al.  Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.

[14]  Shu Liu,et al.  List Decoding of Cover Metric Codes Up to the Singleton Bound , 2018, IEEE Transactions on Information Theory.

[15]  Paul H. Siegel,et al.  Decoding of cyclic codes over symbol-pair read channels , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[16]  Tao Zhang,et al.  New constructions of MDS symbol-pair codes , 2016, Des. Codes Cryptogr..

[17]  Jaikumar Radhakrishnan,et al.  Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes , 2010, IEEE Transactions on Information Theory.

[18]  Mario Blaum,et al.  Codes for Symbol-Pair Read Channels , 2010, IEEE Transactions on Information Theory.

[19]  Venkatesan Guruswami,et al.  A Lower Bound on List Size for List Decoding , 2005, IEEE Trans. Inf. Theory.

[20]  Paul H. Siegel,et al.  Constructions and Decoding of Cyclic Codes Over $b$ -Symbol Read Channels , 2016, IEEE Transactions on Information Theory.

[21]  Shigeichi Hirasawa,et al.  Linear programming decoding of binary linear codes for symbol-pair read channels , 2015, 2016 IEEE International Symposium on Information Theory (ISIT).