中文
相关论文

相关论文: The covering radius of $\mathrm{PGL}_2(q)$

200 篇论文

The covering radius of permutation group codes are studied in this paper with $l_{\infty}$-metric. We determine the covering radius of the $(p,q)$-type group, which is a direct product of two cyclic transitive groups. We also deduce the…

组合数学 · 数学 2019-05-21 Xin Wei , Xiande Zhang

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the minimum number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We find lower bounds linear in $n$ for…

群论 · 数学 2020-12-09 Daniela Bubboloni , Cheryl E. Praeger , Pablo Spiga

We generalize to any q a theorem about covering radius of linear codes proved by Helleseth, Klove and Mykkelvit. Then we determine the covering radius of first order generalized Reed-Muller codes in second order generalized Reed-Muller…

数论 · 数学 2011-02-11 Elodie Leducq

A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…

群论 · 数学 2026-02-02 Andrea Lucchini

This paper gives lower and upper bounds on the covering radius of codes over $\mathbb{Z}_{p^2}$ with respect to Lee distance. We also determine the covering radius of various Repetition codes over $\mathbb{Z}_{p^2}.$

信息论 · 计算机科学 2017-11-07 N. Annamalai , C. Durairajan

For an integer $s\ge 1$, let $\mathcal{C}_s(q_0)$ be the generalized Zetterberg code of length $q_0^s+1$ over the finite field $\F_{q_0}$ of odd characteristic. Recently, Shi, Helleseth, and \"{O}zbudak (IEEE Trans. Inf. Theory 69(11):…

信息论 · 计算机科学 2024-11-22 Minjia Shi , Shitao Li , Tor Helleseth , Ferruh Ozbudak

The covering number, $\sigma(G)$, of a finite, noncyclic group $G$ is the least positive integer $n$ such that $G$ is the union of $n$ proper subgroups. Here we investigate the covering numbers of the projective special unitary groups…

群论 · 数学 2021-09-21 Michael Epstein

We employ analytic number theoretic techniques, specifically character sums and Weil type estimates, to study the covering radius of the generalized Zetterberg codes over all finite fields. Although the even and odd field cases require…

数论 · 数学 2025-10-30 Haode Yan , Maosheng Xiong

We study the covering radii of $2$-transitive permutation groups of Lie rank one, giving bounds and links to finite geometry.

组合数学 · 数学 2017-11-07 John Bamberg , Cheryl E. Praeger , Binzhou Xia

A binary code with covering radius $R$ is a subset $C$ of the hypercube $Q_n=\{0,1\}^n$ such that every $x\in Q_n$ is within Hamming distance $R$ of some codeword $c\in C$, where $R$ is as small as possible. For a fixed coordinate…

组合数学 · 数学 2007-05-23 Robert B. Ellis

If a group $G$ is the union of proper subgroups $H_1, \dots, H_k$, we say that the collection $\{H_1, \dots H_k \}$ is a cover of $G$, and the size of a minimal cover (supposing one exists) is the covering number of $G$, denoted…

群论 · 数学 2016-02-04 Eric Swartz

It was proved by J. Schatz that the covering radius of the second order Reed--Muller code $RM(2, 6)$ is 18 (IEEE Trans Inf Theory 27: 529--530, 1985). However, the covering radius of $RM(2,7)$ has been an open problem for many years. In…

信息论 · 计算机科学 2018-09-14 Qichun Wang

We obtain a classification of the completely regular codes with covering radius 1 and the second eigenvalue in the Hamming graphs H(3,q) up to q and intersection array. Due to works of Meyerowitz, Mogilnykh and Valyuzenich, our result…

组合数学 · 数学 2024-03-06 Ivan Mogilnykh , Anna Taranenko , Konstantin Vorob'ev

Consider the family of all perfect matchings of the complete graph $K_{2n}$ with $2n$ vertices. Given any collection $\mathcal M$ of perfect matchings of size $s$, there exists a maximum number $f(n,x)$ such that if $s\leq f(n,x)$, then…

组合数学 · 数学 2021-09-30 Cheng Yeaw Ku , Alan J. Aw

A set of proper subgroups is a covering for a group if its union is the whole group. The minimal number of subgroups needed to cover $G$ is called the covering number of $G$, denoted by $\sigma(G)$. Determining $\sigma(G)$ is an open…

The orbital diameter of a primitive permutation group is the maximal diameter of its orbital graphs. There has been a lot of interest in bounds for the orbital diameter. In this paper we provide explicit bounds on the diameters of groups of…

群论 · 数学 2021-03-10 Kamilla Rekvényi

An $m$-$cover$ of lines of a finite projective space ${\rm PG}(r,q)$ (of a finite polar space $\cal P$) is a set of lines $\cal L$ of ${\rm PG}(r,q)$ (of $\cal P$) such that every point of ${\rm PG}(r,q)$ (of $\cal P$) contains $m$ lines of…

组合数学 · 数学 2018-07-03 A. Cossidente , F. Pavese

SL_q(2) at odd roots of unity q^l =1 is studied as a quantum cover of the complex rotation group SO(3,C), in terms of the associated Hopf algebras of (quantum) polynomial functions. We work out the irreducible corepresentations, the…

量子代数 · 数学 2012-04-19 Ludwik Dabrowski , Cesare Reina

A translation structure equips a Riemann surface with a singular flat metric. Not much is known about the shape of a random translation surface. We compute an upper bound on the expected value of the covering radius of a translation surface…

几何拓扑 · 数学 2020-04-20 Howard Masur , Kasra Rafi , Anja Randecker

A primary covering of a finite group $G$ is a family of proper subgroups of $G$ whose union contains the set of elements of $G$ having order a prime power. We denote with $\sigma_0(G)$ the smallest size of a primary covering of $G$, and…

群论 · 数学 2021-04-05 Francesco Fumagalli , Martino Garonzi
‹ 上一页 1 2 3 10 下一页 ›