2 problems

Let ${\mathbb C}$ be an $(n,k,d)$ MDS code over ${\mathbb F}_{q}$. Its stopping redundancy is the minimum number of rows in a parity-check matrix of ${\mathbb C}$ whose associated…

Let ${\mathcal{C}}$ be an $[n,k=n-d+1,d]$ linear MDS code, and let $\rho({\mathcal{C}})$ denote its stopping redundancy, the smallest number of rows in a parity-check matrix whose…