One of the interesting problems in coding theory is to determine the value nq(k, d) which denotes the smallest number n such that an [n, k, d]q code exists for given k, d and q. For k â‰¤ 5, there areâ€¦ (More)

Two equivalent linear codes have the same weight enumerator but the converse does not hold. We investigate which code is unique up to equivalence in view of the weight enumerator. The main purpose ofâ€¦ (More)

For q5 âˆ’ q3 âˆ’ q2 âˆ’ q + 1 â‰¤ d â‰¤ q5 âˆ’ q3 âˆ’ q2, we prove the non-existence of a [gq(6, d), 6, d]q code and we give a [gq(6, d) + 1, 6, d]q code by constructing appropriate 0-cycle in the projectiveâ€¦ (More)

Hamada ([8]) and Maruta ([17]) proved the minimum length n3(6, d) = g3(6, d) + 1 for some ternary codes. In this paper we consider such minimum length problem for q â‰¥ 4, and we prove that nq(6, d) =â€¦ (More)

It is known that 42 is the largest size of a 6-arc in the Desarguesian projective plane of order 8. In this paper, we classify these (42, 6)8 arcs. Equivalently, we classify the smallest 3-foldâ€¦ (More)