Abstract
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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.