We give a method to construct deep holes for elliptic curve codes. For l...
In this paper, we improve the algorithms of Lauder-Wan <cit.> and Harvey...
For any affine hypersurface defined by a complete symmetric polynomial i...
Projective Reed-Solomon (PRS) codes are Reed-Solomon codes of the maximu...
n this paper, we obtain an asymptotic formula for the number of codeword...
In this paper, we determine the covering radius and a class of deep hole...
Suppose p is a prime, t is a positive integer, and
f∈Z[x] is a univariat...