On the dual code of points and generators on the Hermitian variety H(2n+1,q2)
Abstract
We study the dual linear code of points and generators on a non-singular Hermitian variety H(2n+1,q2). We improve the earlier results for n=2, we solve the minimum distance problem for general n, we classify the n smallest types of code words and we characterize the small weight code words as being a linear combination of these n types.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.