On small dense sets in Galois planes.

Giulietti, M.

Displaying similar documents to “On small dense sets in Galois planes.”

Collineation group as a subgroup of the symmetric group

Fedor Bogomolov, Marat Rovinsky (2013)

Open Mathematics

Similarity:

Let ψ be the projectivization (i.e., the set of one-dimensional vector subspaces) of a vector space of dimension ≥ 3 over a field. Let H be a closed (in the pointwise convergence topology) subgroup of the permutation group $𝔖_{ψ}$ of the set ψ. Suppose that H contains the projective group and an arbitrary self-bijection of ψ transforming a triple of collinear points to a non-collinear triple. It is well known from [Kantor W.M., McDonough T.P., On the maximality of PSL(d+1,q), d ≥ 2, J. London...

Dual codes of projective planes of order 25.

Clark, K. L., Hatfield, L. D., Key, J. D., Ward, H. N. (2003)

Advances in Geometry

Similarity:

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

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

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Families of nets of low and medium strength.

Bierbrauer, Jürgen, Edel, Yves (2005)

Integers

Similarity:

Codes and projective multisets.

Dodunekov, Stefan, Simonis, Juriaan (1998)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Construction of Optimal Linear Codes by Geometric Puncturing

Maruta, Tatsuya (2013)

Serdica Journal of Computing

Similarity:

Dedicated to the memory of S.M. Dodunekov (1945–2012)Abstract. Geometric puncturing is a method to construct new codes. ACM Computing Classification System (1998): E.4. ∗This research was partially supported by Grant-in-Aid for Scientific Research of Japan Society for the Promotion of Science under Contract Number 24540138.

The minimum size of complete caps in ${(ℤ / n ℤ)}^{2}$ .

Huizenga, Jack (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On mixed codes with covering radius 1 and minimum distance 2.

Haas, Wolfgang, Quistorff, Jörn (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Codes that attain minimum distance in every possible direction

Gyula Katona, Attila Sali, Klaus-Dieter Schewe (2008)

Open Mathematics

Similarity:

The following problem motivated by investigation of databases is studied. Let $𝒞$ be a q-ary code of length n with the properties that $𝒞$ has minimum distance at least n − k + 1, and for any set of k − 1 coordinates there exist two codewords that agree exactly there. Let f(q, k)be the maximum n for which such a code exists. f(q, k)is bounded by linear functions of k and q, and the exact values for special k and qare determined.

Some remarks on the Plotkin bound.

Quistorff, Jörn (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Semifields in class $ℱ_{4}^{(a)}$ .

Ebert, Gary, Marino, Giuseppe, Polverino, Olga, Trombetti, Rocco (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

3-designs from PGL $(2, q)$ .

Cameron, P.J., Omidi, G.R., Tayfeh-Rezaie, B. (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On optimal linear codes over $𝔽_{8}$ .

Kanazawa, Rie, Maruta, Tatsuya (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity: