Exploració per autor "Ball, Simeon Michael"
Ara es mostren els items 21-40 de 55
-
CODES AND CRYPTOGRAPHY
(Universitat Politècnica de Catalunya, 2015-11-11)
Examen
Accés restringit a la comunitat UPC -
CODES AND CRYPTOGRAPHY
(Universitat Politècnica de Catalunya, 2013-11-06)
Examen
Accés restringit a la comunitat UPC -
CODES AND CRYPTOGRAPHY
(Universitat Politècnica de Catalunya, 2015-11-23)
Examen
Accés restringit a la comunitat UPC -
CODES AND CRYPTOGRAPHY (Examen final, 2n quadrimestre)
(Universitat Politècnica de Catalunya, 2022-03-23)
Examen
Accés obert -
COMBINATÒRIA I TEORIA DE GRAFTS | Final
(Universitat Politècnica de Catalunya, 2020-01)
Examen
Accés restringit a la comunitat UPC -
COMBINATÒRIA I TEORIA DE GRAFTS | Parcial
(Universitat Politècnica de Catalunya, 2019-11)
Examen
Accés restringit a la comunitat UPC -
Commutative semifields of rank 2 over their middle nucleus
(Springer, 2001)
Comunicació de congrés
Accés restringit per política de l'editorialThis article is about finite commutative semifields that are of rank 2 over their middle nucleus, the largest subset of elements that is a finite field. These semifields have a direct correspondence to certain flocks of ... -
COMPUTACIÓ QUÀNTICA | FINAL
(Universitat Politècnica de Catalunya, 2023-06-02)
Examen
Accés restringit a la comunitat UPC -
COMPUTACIÓ QUÀNTICA | PARCIAL
(Universitat Politècnica de Catalunya, 2023-04-12)
Examen
Accés restringit a la comunitat UPC -
Determining when a truncated generalised Reed-Solomon code is Hermitian self-orthogonal
(Institute of Electrical and Electronics Engineers (IEEE), 2022-02-09)
Article
Accés obertWe prove that there is a Hermitian self-orthogonal k -dimensional truncated generalised Reed-Solomon code of length n¿q2 over Fq2 if and only if there is a polynomial g¿Fq2 of degree at most (q-k)q-1 such that g+gq has ... -
Extending small arcs to large arcs
(2018-03-01)
Article
Accés obertAn arc is a set of vectors of the k-dimensional vector space over the finite field with q elements Fq , in which every subset of size k is a basis of the space, i.e. every k-subset is a set of linearly independent vectors. ... -
Forbidden subgraphs in the norm graph
(2016-04-06)
Article
Accés obertWe show that the norm graph with n vertices about View the MathML source edges, which contains no copy of the complete bipartite graph Kt,(t-1)!+1, does not contain a copy of Kt+1,(t-1)!-1. -
Grassl–Rötteler cyclic and consta-cyclic MDS codes are generalised Reed–Solomon codes
(Springer, 2022-12-31)
Article
Accés obertWe prove that the cyclic and constacyclic codes constructed by Grassl and Rötteler in International Symposium on Information Theory (ISIT), pp. 1104–1108 (2015) are generalised Reed–Solomon codes. This note can be considered ... -
On additive MDS codes over small fields
(American Institute of Mathematical Sciences, 2022)
Article
Accés obertLet $ C $ be a $ (n,q^{2k},n-k+1)_{q^2} $ additive MDS code which is linear over $ {\mathbb F}_q $. We prove that if $ n \geq q+k $ and $ k+1 $ of the projections of $ C $ are linear over $ {\mathbb F}_{q^2} $ then $ C $ ... -
On additive MDS codes with linear projections
(Elsevier, 2023-10-01)
Article
Accés obertWe support some evidence that a long additive MDS code over a finite field must be equivalent to a linear code. More precisely, let C be an -linear MDS code over . If , , , and C has three coordinates from which its ... -
On Segre's lemma of tangents
(2018-07-01)
Article
Accés obertSegre’s lemma of tangents dates back to the 1950’s when he used it in the proof of his “arc is a conic” theorem. Since then it has been used as a tool to prove results about various objects including internal nuclei, Kakeya ... -
On sets defining few ordinary planes
(2017-09-19)
Article
Accés obertLet S be a set of n points in real three-dimensional space, no three collinear and not all co-planar. We prove that if the number of planes incident with exactly three points of S is less than (Formula presented.) for some ... -
On sets defining few ordinary solids
(Springer Nature, 2021-05-04)
Article
Accés obertLet S be a set of n points in real four-dimensional space, no four coplanar and spanning the whole space. We prove that if the number of solids incident with exactly four points of S is less than Kn3 for some K=o(n1/7) ... -
On sets of points with few odd secants
(2019-10-10)
Article
Accés obertWe prove that, for q odd, a set of q + 2 points in the projective plane over the field with q elements has at least 2q - c odd secants, where c is a constant and an odd secant is a line incident with an odd number of points ... -
On sets of vectors of a finite vector space in which every subset of basis size is a basis II
(2012-10)
Article
Accés obertThis article contains a proof of the MDS conjecture for k = 2p - 2. That is, that if S is a set of vectors of F k q in which every subset of S of size k is a basis, where q = p h, p is prime and q is not and k = 2p - 2, ...
