Dongchun Han

Roth–Lempel NMDS Codes of Non-Elliptic-Curve Type

2023 · IEEE Transactions on Information Theory

The defect of an$[n,k,d]$linear code is defined as$s({\mathcal{ C}})=n-k+1-d$. Codes with$s({\mathcal{ C}})=0$are called maximum distance separable (MDS), while codes with$s({\mathcal{ C}})=s({\mathcal{ C}}^{\perp})=1$are called near maximum distance separable (NMDS). NMDS codes correspond to interesting objects in …