中文
相关论文

相关论文: New Semifields and new MRD Codes from Skew Polynom…

200 篇论文

The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a…

信息论 · 计算机科学 2019-03-27 Martino Borello , Cem Güneri , Elif Saçıkara , Patrick Solé

Motivated by the constructions of binary sequences by utilizing the cyclic elliptic function fields over the finite field $\mathbb{F}_{2^{n}}$ by Jin \textit{et al.} in [IEEE Trans. Inf. Theory 71(8), 2025], we extend the construction to…

信息论 · 计算机科学 2026-05-11 Xiaofeng Liu , Jun Zhang , Fang-Wei Fu

This article studies one-generator and two-generator quasi-cyclic codes over finite fields. We present two versions of necessary and sufficient conditions for the symplectic selforthogonality of one-generator quasi-cyclic codes, using both…

信息论 · 计算机科学 2024-12-19 Tushar Bag , Hai Q Dinh , Daniel Panario

We will show that the singular cohomology groups of a smooth quasi-projective complex variety relative to a normal crossing divisor can be described in terms of delta-admissible chains. Roughly speaking, a delta-admissible chain is a…

代数几何 · 数学 2020-05-21 Kenichiro Kimura

A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized…

信息论 · 计算机科学 2021-07-12 Gerardo Vega , Félix Hernández

We consider a class of 6D superconformal field theories (SCFTs) which have a large $N$ limit and a semi-classical gravity dual description. Using the quiver-like structure of 6D SCFTs we study a subsector of operators protected from large…

高能物理 - 理论 · 物理学 2020-11-19 Jonathan J. Heckman

Hyperovals in $\PG(2,\gf(q))$ with even $q$ are maximal arcs and an interesting research topic in finite geometries and combinatorics. Hyperovals in $\PG(2,\gf(q))$ are equivalent to $[q+2,3,q]$ MDS codes over $\gf(q)$, called hyperoval…

信息论 · 计算机科学 2018-04-18 Ziling Heng , Cunsheng Ding

MDS codes have garnered significant attention due to their wide applications in practice. To date, most known MDS codes are equivalent to Reed-Solomon codes. The construction of non-Reed-Solomon (non-RS) type MDS codes has emerged as an…

信息论 · 计算机科学 2024-11-25 Lingfei Jin , Liming Ma , Chaoping Xing , Haiyan Zhou

Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in the multishot network coding, the space-time coding and the distributed storage. In this paper, by constructing covering codes…

信息论 · 计算机科学 2026-02-19 Chao Liu , Hao Chen , Qinqin Ji , Ziyan Xie , Dabin Zheng , Yongbo Xia

Binary cyclic codes have been a hot topic for many years, and significant progress has been made in the study of this types of codes. As is well known, it is hard to construct infinite families of binary cyclic codes [n, n+1/2] with good…

信息论 · 计算机科学 2024-04-30 Tingting Wu , Lanqiang Li , Xiuyu Zhang , Shixin Zhu

We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective…

信息论 · 计算机科学 2025-01-08 Chiara Castello , Heide Gluesing-Luerssen , Olga Polverino , Ferdinando Zullo

The aim of this paper is to survey on the known results on maximum scattered linear sets and MRD-codes. In particular, we investigate the link between these two areas. In "A new family of linear maximum rank distance codes" (2016) Sheekey…

组合数学 · 数学 2020-01-29 Olga Polverino , Ferdinando Zullo

In this paper, we propose a sufficient condition for a family of 2-generator self-orthogonal quasi-cyclic codes with respect to Hermitian inner product. Supported in the Hermitian construction, we show algebraic constructions of good…

信息论 · 计算机科学 2025-11-25 Liangdong Lu , Gaochi Zhang , Ganyu Feng , Wenzheng Ma

We design new polynomial-time algorithms for recovering planted cliques in the semi-random graph model introduced by Feige and Kilian 2001. The previous best algorithms for this model succeed if the planted clique has size at least…

数据结构与算法 · 计算机科学 2023-06-07 Rares-Darius Buhai , Pravesh K. Kothari , David Steurer

We describe new families of Eliahou semigroups, encompassing previous families described by Delgado, Eliahou and Fromentin, and Bras-Amor\'os. A crucial parameter is a Farey interval associated to the semigroup. We show that these…

组合数学 · 数学 2026-05-13 Axel Bacher

A classical result of Conway and Pless is that a natural projection of the fixed code of an automorphism of odd prime order of a self-dual binary linear code is self-dual. In this paper we prove that the same holds for involutions under…

组合数学 · 数学 2014-11-25 Martino Borello , Gabriele Nebe

A new type of nonlocal currents (quasi-particles), which we call twisted parafermions, and its corresponding twisted $Z$-algebra are found. The system consists of one spin-1 bosonic field and six nonlocal fields of fractional spins.…

高能物理 - 理论 · 物理学 2009-11-07 Xiang-Mao Ding , Mark. D. Gould , Yao-Zhong Zhang

This paper studies three results that describe the structure of the super-coinvariant algebra of pseudo-reflection groups over a field of characteristic $0$. Our most general result determines the top component in total degree, which we…

组合数学 · 数学 2021-09-09 Joshua P. Swanson , Nolan R. Wallach

Cyclic subspace codes gained a lot of attention especially because they may be used in random network coding for correction of errors and erasures. Roth, Raviv and Tamo in 2018 established a connection between cyclic subspace codes (with…

组合数学 · 数学 2022-12-29 Ferdinando Zullo

In this paper we study a family of scattered $\F_q$--linear sets of rank $tn$ of the projective space $PG(2n-1,q^t)$ ($n \geq 1$, $t\geq 3$), called of {\it pseudoregulus type}, generalizing results contained in [G. Marino, O. Polverino, R.…

组合数学 · 数学 2013-06-27 G. Lunardon , G. Marino , O. Polverino , R. Trombetti