Related papers: Linear codes associated with the Desarguesian ovoi…
We show analytically that the QCD potential can be expressed, up to an O(Lambda_QCD^3 r^2) uncertainty, as the sum of a ``Coulomb'' potential (with log corrections at short distances) and a linear potential, within an approximation based on…
Our main result is the construction of symmetric Hadamard matrices of order q(1 + q) where q is a prime power congruent to 3 mod 8.
V. Guruswami and N. Resch prove that the list decodability of $\mathbb{F}_q$-linear rank metric codes is as good as that of random rank metric codes in~\cite{venkat2017}. Due to the potential applications of self-orthogonal rank metric…
We classify irreducible polar foliations of codimension $q$ on quaternionic projective spaces $\mathbb H P^n$, for all $(n,q)\neq(7,1)$. We prove that all irreducible polar foliations of any codimension (resp. of codimension one) on…
A family of $\omega$-circulant balanced weighing matrices with classical parameters is used for the construction of optimal constant weight codes over an alphabet of size $g+1$ and length $n=(q^m -1)/(q-1)$, where $q$ is an odd prime power,…
In this article, we construct linear codes over the commutative non-unital ring $I$ of size four. We obtain their Lee-weight distributions and study their binary Gray images. Under certain mild conditions, these classes of binary codes are…
An $\mathbb{F}_q$- linear set $L=L_U$ of $\Lambda=\mathrm{PG}(V, \mathbb{F}_{q^n}) \cong \mathrm{PG}(r-1,q^n)$ is a set of points defined by non-zero vectors of an $\mathbb{F}_q$-subspace $U$ of $V$. The integer $\dim_{\mathbb{F}_q} U$ is…
We generalise a result of Bykovskii to the Gaussian integers and prove an asymptotic formula for the prime geodesic theorem in short intervals on the Picard manifold. Previous works show that individually the remainder is bounded by…
We complete the l-modular decomposition numbers of the unipotent characters in the principal block of the special orthogonal groups SO_7(q) and the symplectic groups Sp_6(q) for all prime powers q and all odd primes l different from the…
We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimum distance of these codes was conjectured in 2000 and after having been established in various special cases, it was proved in 2008 by…
We give improved lower bounds for binary $3$-query locally correctable codes (3-LCCs) $C \colon \{0,1\}^k \rightarrow \{0,1\}^n$. Specifically, we prove: (1) If $C$ is a linear design 3-LCC, then $n \geq 2^{(1 - o(1))\sqrt{k} }$. A design…
In this paper we present and analyze computational results concerning small complete caps in the projective spaces $\mathrm{PG}(N,q)$ of dimension $N=3$ and $N=4$ over the finite field of order $q$. The results have been obtained using…
For any prime power $q$, Mori and Tanaka introduced a family of $q$-ary polar codes based on $q$~by~$q$ Reed-Solomon polarization kernels. For transmission over a $q$-ary erasure channel, they also derived a closed-form recursion for the…
We study an approximate version of $q$-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A $q$-query $(\alpha,\delta)$-approximate LDC is a set $V$ of $n$ points in…
New examples of Cameron-Liebler line classes in $\mathrm{PG}(3,q)$ are given with parameter $\frac{1}{2}(q^2 -1)$. These examples have been constructed for many odd values of $q$ using a computer search, by forming a union of line orbits…
Let A be the incidence matrix of passant lines and internal points with respect to a conic in PG(2, q), where q is an odd prime power. In this article, we study both geometric and algebraic properties of the column null space L of A over…
We present a new decoding algorithm based on error locating pairs and correcting an amount of errors exceeding half the minimum distance. When applied to Reed--Solomon or algebraic geometry codes, the algorithm is a reformulation of the…
Polar codes were recently introduced by Ar\i kan. They achieve the capacity of arbitrary symmetric binary-input discrete memoryless channels under a low complexity successive cancellation decoding strategy. The original polar code…
In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family…
Polar code, with explicit construction and recursive structure, is the latest breakthrough in channel coding field for its low-complexity and theoretically capacity-achieving property. Since polar codes can approach the maximum likelihood…