List Decodability of Symbol-Pair Codes

06/23/2018
by   Shu Liu, et al.
0

We investigate the list decodability of symbol-pair codes in the present paper. Firstly, we show that 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/12/2022

A Lower Bound on the List-Decodability of Insdel Codes

For codes equipped with metrics such as Hamming metric, symbol pair metr...
research
06/25/2022

Covering b-Symbol Metric Codes and the Generalized Singleton Bound

Symbol-pair codes were proposed for the application in high density stor...
research
11/29/2018

Joint Design of Convolutional Code and CRC under Serial List Viterbi Decoding

This paper studies the joint design of optimal convolutional codes (CCs)...
research
06/08/2018

List-decoding homomorphism codes with arbitrary codomains

The codewords of the homomorphism code aHom(G,H) are the affine homomorp...
research
02/23/2018

Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel

We consider the problem of determining the zero-error list-decoding capa...
research
05/09/2018

Optimally Sorting Evolving Data

We give optimal sorting algorithms in the evolving data framework, where...
research
10/09/2020

Lattice (List) Decoding Near Minkowski's Inequality

Minkowski proved that any n-dimensional lattice of unit determinant has ...

Please sign up or login with your details

Forgot password? Click here to reset