Abstract

In a previous paper (see [3]) we determined the values of the next-to-minimal Hamming weights of affine cartesian codes of order d, for almost all values of d. In the present paper we determine the next-to-minimal weights for the missing values of d, assuming that the sets in the cartesian product which appears in the definition of the code are subfields of Fq.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call