English
Related papers

Related papers: Linear codes associated with the Desarguesian ovoi…

200 papers

Let $V$ be a vector space over the finite field $\mathbb{F}_q$ with $q$ elements and $\Lambda$ be the image of the Segre geometry $\mathrm{PG}(V)\otimes\mathrm{PG}(V^*)$ in $\mathrm{PG}(V\otimes V^*)$. Consider the subvariety $\Lambda_{1}$…

Combinatorics · Mathematics 2025-12-04 Ilaria Cardinali , Luca Giuzzi

We construct a [(n+1)/2]+1 parameters family of irreducible representations of the Braid group B_3 in arbitrary dimension n\in N, using a q-deformation of the Pascal triangle. This construction extends in particular results by S.P.Humphries…

Quantum Algebra · Mathematics 2008-03-24 Sergio Albeverio , Alexandre Kosyak

We study the problem of classifying the lines of the projective $3$-space $PG(3,q)$ over a finite field $GF(q)$ into orbits of the group $G=PGL(2,q)$ of linear symmetries of the twisted cubic $C$. A generic line neither intersects $C$ nor…

Combinatorics · Mathematics 2025-08-12 Krishna Kaipa , Nupur Patanker , Puspendu Pradhan

In this paper, we resolve a conjecture of Green and Liebeck [Disc. Math., 343 (8):117119, 2019] on codes in $PGL(2,q)$. To be specific, we show that: if $D$ is a dihedral subgroup of order $2(q+1)$ in $G=PGL(2,q)$, and $A=\{g\in G: g^{q+1}=…

Combinatorics · Mathematics 2020-09-03 Tao Feng , Weicong Li , Jingkun Zhou

We propose a new family of polar coding which realizes high coding gain, low complexity, and high throughput by introducing a protograph-based design. The proposed technique called as quasi-cyclic (QC) polar codes can be highly parallelized…

Information Theory · Computer Science 2021-02-26 Toshiaki Koike-Akino , Ye Wang

We generalized to higher dimensions the notions of optical orthogonal codes. We establish uper bounds on the capacity of general $ n $-dimensional OOCs, and on specific types of ideal codes (codes with zero off-peak autocorrelation). The…

Combinatorics · Mathematics 2022-07-18 Tim Alderson

We prove that a random linear code over F_q, with probability arbitrarily close to 1, is list decodable at radius (1-1/q-\epsilon) with list size L=O(1/\epsilon^2) and rate R=\Omega_q(\epsilon^2/(log^3(1/\epsilon))). Up to the…

Information Theory · Computer Science 2012-07-06 Mahdi Cheraghchi , Venkatesan Guruswami , Ameya Velingker

In the present paper, we study various Erd\H{o}s type geometric problems in the setting of the integers modulo $q$, where $q=p^l$ is an odd prime power. More precisely, we prove certain results about the distribution of triangles and…

Combinatorics · Mathematics 2014-06-26 Esen Aksoy Yazici

We use the representation $T_2(O)$ for $\q(4,q)$ to show that maximal partial ovoids of $\q(4,q)$ of size $q^2-1$, $q=p^h$, $p$ odd prime, $h > 1$, do not exist. Although this was known before, we give a slightly alternative proof, also…

Combinatorics · Mathematics 2012-03-09 Jan De Beule

In this paper, we construct three binary linear codes $C(SO^+(2,q))$, $C(O^+(2,q))$, $C(SO^+(4,q))$, respectively associated with the orthogonal groups $SO^+(2,q)$, $O^+(2,q)$, $SO^+(4,q)$, with $q$ powers of two. Then we obtain recursive…

Number Theory · Mathematics 2008-07-30 Dae San Kim

A code is called a $q$-query locally decodable code (LDC) if there is a randomized decoding algorithm that, given an index $i$ and a received word $w$ close to an encoding of a message $x$, outputs $x_i$ by querying only at most $q$…

Computational Complexity · Computer Science 2019-12-03 Arnab Bhattacharyya , L. Sunil Chandran , Suprovat Ghoshal

Given an elliptic curve $E$ over a finite field $\F_q$ of $q$ elements, we say that an odd prime $\ell \nmid q$ is an Elkies prime for $E$ if $t_E^2 - 4q$ is a quadratic residue modulo $\ell$, where $t_E = q+1 - #E(\F_q)$ and $#E(\F_q)$ is…

Number Theory · Mathematics 2013-01-03 Igor Shparlinski

We introduce a family of linear sets of $\mathrm{PG}(1,q^{2n})$ arising from maximum scattered linear sets of pseudoregulus type of $\mathrm{PG}(3,q^{n})$. For $n=3,4$ and for certain values of the parameters we show that these linear sets…

Combinatorics · Mathematics 2017-07-27 Bence Csajbók , Giuseppe Marino , Olga Polverino , Corrado Zanella

A family of sets $F$ is said to satisfy the $(p,q)$ property if among any $p$ sets in $F$, some $q$ have a non-empty intersection. Hadwiger and Debrunner (1957) conjectured that for any $p \geq q \geq d+1$ there exists $c=c_d(p,q)$, such…

Combinatorics · Mathematics 2018-11-06 Chaya Keller , Shakhar Smorodinsky

In the literature, lines of the projective space $\mathrm{PG}(3,q)$ are partitioned into classes, each of which is a union of line orbits under the stabilizer group of the twisted cubic. The least studied class is named $\mathcal{O}_6$.…

Combinatorics · Mathematics 2024-09-17 Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

The $p$-ary linear code $\mathcal C_{k}(n,q)$ is defined as the row space of the incidence matrix $A$ of $k$-spaces and points of $\text{PG}(n,q)$. It is known that if $q$ is square, a codeword of weight $q^k\sqrt{q}+\mathcal O \left(…

Combinatorics · Mathematics 2024-04-30 Sam Adriaensen , Lins Denaux

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p \times n$ matrix, where nonzero entries are filled by $\pm z_i$ or $\pm z^*_i$, $i = 1, 2,..., k$, such…

Information Theory · Computer Science 2012-04-03 Yuan Li , Haibin Kan

We generalise the work of Segre (1965), Cameron - Goethals - Seidel (1978), and Vanhove (2011) by showing that nontrivial $m$-ovoids of the dual polar spaces $DQ(2d, q)$, $DW(2d-1,q)$ and $DH(2d-1,q^2)$ ($d\ge 3$) are hemisystems. We also…

Combinatorics · Mathematics 2017-05-16 John Bamberg , Jesse Lansdown , Melissa Lee

Minimal codes are being intensively studied in last years. $[n,k]_{q}$-minimal linear codes are in bijection with strong blocking sets of size $n$ in $PG(k-1,q)$ and a lower bound for the size of strong blocking sets is given by…

Combinatorics · Mathematics 2022-12-07 Valentino Smaldore

In this paper, we propose and analyze a multiscale method for a class of quasilinear elliptic problems of nonmonotone type with spatially multiscale coefficient. The numerical approach is inspired by the Localized Orthogonal Decomposition…

Numerical Analysis · Mathematics 2025-07-28 Maher Khrais , Barbara Verfürth
‹ Prev 1 3 4 5 6 7 10 Next ›