DeepAI AI Chat
Log In Sign Up

List Decodability of Symbol-Pair Codes

by   Shu Liu, et al.
University of Electronic Science and Technology of China
Nanyang Technological University
Centrum Wiskunde & Informatica

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.


page 1

page 2

page 3

page 4


A Lower Bound on the List-Decodability of Insdel Codes

For codes equipped with metrics such as Hamming metric, symbol pair metr...

Covering b-Symbol Metric Codes and the Generalized Singleton Bound

Symbol-pair codes were proposed for the application in high density stor...

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

This paper studies the joint design of optimal convolutional codes (CCs)...

List-decoding homomorphism codes with arbitrary codomains

The codewords of the homomorphism code aHom(G,H) are the affine homomorp...

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...

Optimally Sorting Evolving Data

We give optimal sorting algorithms in the evolving data framework, where...

Lattice (List) Decoding Near Minkowski's Inequality

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