加载中…
We study the dual linear code of points and generators on a non-singular Hermitian variety . We improve the earlier results for , we solve the minimum distance problem for general , we classify the smallest types of code words and we characterize the small weight code words as being a linear combination of these types.

生成讲解博客的中文版本

生成AI智能校验的中文版本