中文
相关论文

相关论文: Minimal linear codes in odd characteristic

200 篇论文

The minimal infinitesimal rigidity of bar-joint frameworks in the non-Euclidean spaces (R^2, ||.||_q) are characterised in terms of (2,2)-tight graphs. Specifically, a generically placed bar-joint framework (G,p) in the plane is minimally…

度量几何 · 数学 2017-05-17 Derek Kitson , Stephen Power

In this note we construct a new infinite family of $(q-1)$-regular graphs of girth $8$ and order $2q(q-1)^2$ for all prime powers $q\ge 16$, which are the smallest known so far whenever $q-1$ is not a prime power or a prime power plus one…

组合数学 · 数学 2015-01-13 M. Abreu , G. Araujo-Pardo , C. Balbuena , D. Labbate

The structure of multivariate semisimple codes over a finite chain ring $R$ is established using the structure of the residue field $\bar R$. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include…

组合数学 · 数学 2007-05-23 E. Martinez-Moro , I. F. Rua

Some new families of small complete caps in $PG(N,q)$, $q$ even, are described. By using inductive arguments, the problem of the construction of small complete caps in projective spaces of arbitrary dimensions is reduced to the same problem…

We investigate additive codes, defined as $\mathbb{F}_q$-linear subspaces $C \subseteq \mathbb{F}_{q^h}^n$ of length $n$ and dimension $r$ over $\mathbb{F}_q$. An additive code is said to be of type $[n, r/h, d]_q^h$, where $d$ denotes the…

组合数学 · 数学 2025-09-04 Daniele Bartoli , Alessandro Giannoni , Giuseppe Marino , Yue Zhou

We analyse the complexity of constructing involution centralisers in unitary groups over fields of odd order. In particular, we prove logarithmic bounds on the number of random elements required to generate a subgroup of the centraliser of…

群论 · 数学 2019-09-23 S. P. Glasby , Cheryl E. Praeger , Colva M. Roney-Dougal

In this article, we construct infinite families of quaternary (that is, over the ring $\mathbb{Z}_4$) $\mathcal{C}_{D}$-codes, where the defining set $D$ is derived utilizing a two-generator simplicial complex, and determine their Lee…

信息论 · 计算机科学 2026-05-15 Ankit Yadav , Nilay Kumar Mondal , Ritumoni Sarma

In this short note, we will show the following weak evidence of S. Lang conjecture over function fields. Let f : X ---> Y be a projective and surjective morphism of algebraic varieties over an algebraically closed field k of characteristic…

alg-geom · 数学 2008-02-03 Atsushi Moriwaki

An irreducible smooth projective curve over $\mathbb{F}\_q$ is called \textit{pointless} if it has no $\mathbb{F}\_q$-rational points. In this paper we study the lower existence bound on the genus of such a curve over a fixed finite field…

代数几何 · 数学 2017-03-27 Ivan Pogildiakov

Bazzi and Mitter [3] showed that binary dihedral group codes are asymptotically good. In this paper we prove that the dihedral group codes over any finite field with good mathematical properties are asymptotically good. If the…

信息论 · 计算机科学 2021-07-05 Yun Fan , Liren Lin

We consider binary abelian codes of length $p^m q^n$, where $p$ and $q$ are prime rational integers under some restrictive hypotheses. In this case, we determine the idempotents generating minimal codes and either the respective weights or…

信息论 · 计算机科学 2012-05-28 Gladys Chalom , Raul Antônio Ferraz , Marinês Guerreiro , César Polcino Milies

Near maximum distance separable (NMDS) codes, where both the code and its dual are almost maximum distance separable, play pivotal roles in combinatorial design theory and cryptographic applications. Despite progress in fixed dimensions…

信息论 · 计算机科学 2025-04-10 Yaozong Zhang , Dabin Zheng , Xiaoqiang Wang , Wei Lu

In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…

信息论 · 计算机科学 2022-01-03 Yansheng Wu , Chengju Li , Fu Xiao

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in…

信息论 · 计算机科学 2023-05-03 Tingfang Chen , Cunsheng Ding , Chengju Li , Zhonghua Sun

Motivated by Xing's method [7], we show that there exist [n,k,d] linear Hermitian codes over F_{q^2} with k+d>=n-3 for all sufficiently large q. This improves the asymptotic bound of Algebraic-Geometry codes from Hermitian curves given in…

代数几何 · 数学 2007-09-14 Siman Yang

In a 2022, Bartoli, Cossidente, Marino, and Pavese proved that in the projective space ${\rm PG}(3,q^3)$, one can find three $\mathbb F_q$-subgeometries such that the union of their point sets is a strong blocking set. This proves the…

组合数学 · 数学 2025-11-20 Sam Adriaensen , Peter Sziklai , Zsuzsa Weiner

We introduce new yet easily accessible codes for elements of $GL_r(A)$ with $A$ the adelic ring of a (dimension one) function field over a finite field. They are linear codes, and coincide with classical algebraic geometry codes when $r=1$.…

信息论 · 计算机科学 2018-06-13 Lin Weng

We discuss the birational geometry of singular surfaces in positive characteristic. More precisely, we establish the minimal model program and the abundance theorem for Q-factorial surfaces and for log canonical surfaces. Moreover, in the…

代数几何 · 数学 2015-03-17 Hiromu Tanaka

Over a field of characteristic 2, we give a complete classification of quadratic and bilinear forms of dimension 5 that are minimal over the function field of an arbitrary conic. This completes the unique known case due to Faivre concerning…

交换代数 · 数学 2025-04-10 Adam Chapman , Ahmed Laghribi

It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…

量子物理 · 物理学 2007-05-23 Eric M. Rains