On the Structure of Higher Order MDS Codes

Harshithanjani Athi, Rasagna Chigullapally, Prasad Krishnan +1

A code of length $n$ is said to be (combinatorially) $(\rho ,L)$-list decodable if the Hamming ball of radius $\rho n$ around any vector in the ambient space does not contain more than $L$…