A Griesmer-Type Bound for List-Decodable Linear Codes

Shengwei Liu, Chunyan Qin

A code $C\subseteq F_q^n$ is $(\tau ,L)$-list-decodable if every Hamming ball of radius $\tau$ contains at most $L$ codewords of $C$. Here $\tau$ is the list-decoding radius, and $L$ is the…