Abstract Let R= F _ 2^ m+ u F _ 2^ m+ ⋯+ u^ k F _ 2^ m R= F 2 m+ u F 2 m+⋯+ uk F 2 m,
where F _ 2^ m F 2 m is the finite field with 2^ m 2 m elements, m is a positive integer, and u …

The non-existence of 29+ h, 3+ h, 26 _ 16 29+ h, 3+ h, 26 16 and 29+ h, 4+ h, 25 _ 16 29+ h,
4+ h, 25 16-codes, h ≥ 0 h≥ 0, is proven. These results are obtained using geometrical …

Small Complete Caps from Singular Cubics - Anbar - 2014 - Journal of Combinatorial Designs
- Wiley Online Library Skip to Article Content Skip to Article Information Wiley Online Library …

We give a geometric description of binary quantum stabilizer codes. In the case of distance
d= 4 this leads to the notion of a quaternary quantum cap. We describe several recursive …

In the projective plane PG (2, q), upper bounds on the smallest size t 2 (2, q) of a complete
arc are considered. For a wide region of values of q, the results of computer search obtained …

The minimum size of a complete arc in the planes PG (2, 31) and PG (2, 32) and of a 1-
saturating set in PG (2, 17) and PG (2, 19) is determined. Also, the minimal 1-saturating sets …

Let R be the polynomial residue ring F _ q^ 2+ u F _ q^ 2 F q 2+ u F q 2, where F _ q^ 2 F q 2
is the finite field with q^ 2 q 2 elements, q is a power of a prime p, and u is an indeterminate …

If the underlying field is F2, the answer is easy: AG (n, 2) is itself a cap of 2n points and it
forms up to projective equivalence the unique largest cap in PG (n, 2). Assume therefore we …

In the projective plane PG (2, q), we consider an iterative construction of complete arcs
which adds a new point in each step. It is proved that uncovered points are uniformly …

The nonexistence of an additive quaternary [15,5,9]-code - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …