Dual codes of projective planes of order 25.

Clark, K. L.; Hatfield, L. D.; Key, J. D.; Ward, H. N.

Displaying similar documents to “Dual codes of projective planes of order 25.”

Optimal four-dimensional codes over $GF (8)$ .

Jones, Chris, Matney, Angela, Ward, Harold (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the Non-Existence of Certain M.D.S. Codes and Projective Planes.

Aiden A. Bruen, Robert Silverman (1983)

Mathematische Zeitschrift

Similarity:

The Nonexistence of some Griesmer Arcs in PG(4, 5)

Landjev, Ivan, Rousseva, Assia (2008)

Serdica Journal of Computing

Similarity:

In this paper, we prove the nonexistence of arcs with parameters (232, 48) and (233, 48) in PG(4,5). This rules out the existence of linear codes with parameters [232,5,184] and [233,5,185] over the field with five elements and improves two instances in the recent tables by Maruta, Shinohara and Kikui of optimal codes of dimension 5 over F5.

Blocking sets in $P G (2, q)$ for small $p$ , and partial spreads in $P G (3, 7)$ .

Blokhuis, A., Brouwer, A. E., Wilbrink, H. A. (2003)

Advances in Geometry

Similarity:

An Improvement to the Achievement of the Griesmer Bound

Hamada, Noboru, Maruta, Tatsuya (2010)

Serdica Journal of Computing

Similarity:

We denoted by nq(k, d), the smallest value of n for which an [n, k, d]q code exists for given q, k, d. Since nq(k, d) = gq(k, d) for all d ≥ dk + 1 for q ≥ k ≥ 3, it is a natural question whether the Griesmer bound is attained or not for d = dk , where gq(k, d) = ∑[d/q^i], i=0,...,k-1, dk = (k − 2)q^(k−1) − (k − 1)q^(k−2). It was shown by Dodunekov [2] and Maruta [9], [10] that there is no [gq(k, dk ), k, dk ]q code for q ≥ k, k = 3, 4, 5 and for q ≥ 2k − 3, k ≥ 6. The purpose...