Tatsuya Maruta

Extendability of Ternary Linear Codes

There are four diversities for which ternary linear codes of dimension k ≥ 3, minimum distance d with gcd(3,d) = 1 are always extendable. Moreover, three of them yield double extendability when d ≡ 1 (mod 3). All the diversities are found for ternary linear codes of dimension 3 ≤ k ≤ 6. An algorithm how to find an extension from a generator matrix is also given.

Extendability of linear codes over GF(q) with minimum distance d, gcd(d,q)=1

The relation between the extendability of linear codes over GF(q) having the minimum distance d with gcd(d,q)=1 and blocking sets with respect to lines in the projective space is given. From this geometrical point of view, some new conditions for which such codes are extendable are given.

On the Nonexistence of q -ary Linear Codesof Dimension Five

AbstractThere do not exist

On the minimum length of q -ary linear codes of dimension four

[n,5,d]

On the minimum size of some minihypers and related linear codes

codes over the Galois field GF

Constructing linear codes from some orbits of projectivities

\left( q \right)