A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$

Hengfeng Liu, Chunming Tang, Zhengchun Zhou +2

A linear code with parameters $[n,k,n-k+1]$ is called maximum distance separable (MDS), and one with parameters $[n,k,n-k]$ is called almost MDS (AMDS). A code is near-MD…