All Questions

In a paper on a proximity test for Reed-Solomon codes the authors state an "extremely optimistical" conjecture on the list decodability of Reed-Solomon codes (over prime fields $\mathbb F_q$)...

Are there explicit or random construction of linear codes that achieve the $GV$ bound with polynomial time decodable property with alphabet size $q=2$? Tsfasman, Manin, Vladut beat the bound at ...

Question (informal version): Are algebraic geometry error correcting codes (V.D. Goppa codes) "good" ? Some details. There is certain construction of error-correcting codes by means of algebraic ...

Consider linear $N$-dimensional space $F_2^N$. Consider its $K$ dimensional subspace $V \subset F_2^N$. Let us calculate $w(k,V,N)$ number of vectors in $V$ of Hamming weight $k$ in $V$. Since there ...

Considered the following inner products: $(1)$ $\langle x,y \rangle = \sum_{t=1}^{n}x_{t}y_{t}$ $(2)$ $\langle x,y \rangle_{c} = \sum_{t=1}^{n}x_{t}\bar{y}_{t}$ consider the following surfaces: $\...