English
Related papers

Related papers: On circular external difference families

200 papers

In this article, we study skew cyclic codes over ring $R=\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$, where $q=p^{m}$, $p$ is an odd prime and $v^{3}=v$. We describe generator polynomials of skew cyclic codes over this ring and…

Information Theory · Computer Science 2017-01-05 Minjia Shi , Ting Yao , Adel Alahmadi , Patrick Solé

Pseudo-splines of integer order $(m,\ell)$ were introduced by Daubechies, Han, Ron, and Shen as a family which allows interpolation between the classical B-splines and the Daubechies' scaling functions. The purpose of this paper is to…

Functional Analysis · Mathematics 2016-04-19 Ole Christensen , Brigitte Forster , Peter Massopust

If the face\mbox{-}cycles at all the vertices in a map are of the same type, then the map is said to be a semi-equivelar map. Automorphism (symmetry) of a map can be thought of as a permutation of the vertices which preserves the…

Combinatorics · Mathematics 2021-01-13 Marbarisha M. Kharkongor , Debashis Bhowmik , Dipendu Maity

The study of permutation automorphism groups of cyclic codes is a central topic in algebraic coding theory. A cyclic code over $\mathbb{F}_q$ is called irreducible if its check polynomial is irreducible over $\mathbb{F}_q$. Such a code is…

Combinatorics · Mathematics 2026-03-03 Tao Feng , Henk D. L. Hollmann , Weicong Li , Qing Xiang

Based on the earlier work of Li (European J. Combin. 1997) and Dobson (Discrete Math. 2008), in this paper we complete the classification of cyclic $m$-DCI-groups and $m$-CI-groups. For a positive integer $m$ such that $m \ge 3$, we show…

Combinatorics · Mathematics 2025-01-22 István Kovács , Luka Šinkovec

Let $m$, $k$ be positive integers such that $\frac{m}{\gcd(m,k)}\geq 3$, $p$ be an odd prime and $\pi $ be a primitive element of $\mathbb{F}_{p^m}$. Let $h_1(x)$ and $h_2(x)$ be the minimal polynomials of $-\pi^{-1}$ and…

Information Theory · Computer Science 2014-07-09 Long Yu , Hongwei Liu

Let $R=\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}+\cdots+u^{k}\mathbb{F}_{2^{m}}$ , where $\mathbb{F}_{2^{m}}$ is a finite field with $2^{m}$ elements, $m$ is a positive integer, $u$ is an indeterminate with $u^{k+1}=0.$ In this paper, we…

Information Theory · Computer Science 2016-08-25 Yongsheng Tang , Shixin Zhu , Xiaoshan Kai , Jian Ding

Supervised anomaly detection methods perform well in identifying known anomalies that are well represented in the training set. However, they often struggle to generalise beyond the training distribution due to decision boundaries that lack…

Machine Learning · Computer Science 2025-11-18 Zahra Zamanzadeh Darban , Qizhou Wang , Charu C. Aggarwal , Geoffrey I. Webb , Ehsan Abbasnejad , Mahsa Salehi

Let $m\geq 3$ be an odd integer and $p$ be an odd prime. % with $p-1=2^rh$, where $h$ is an odd integer. In this paper, many classes of three-weight cyclic codes over $\mathbb{F}_{p}$ are presented via an examination of the condition for…

Information Theory · Computer Science 2013-08-28 Chunlei Li , Nian Li , Tor Helleseth , Cunsheng Ding

Symmetries play an essential role in the construction and phenomenology of quantum field theories (QFTs). We discuss how to construct symmetries of QFTs by extending minimal "seed" symmetry groups to larger groups that contain the seed(s)…

High Energy Physics - Phenomenology · Physics 2025-11-20 Christian Döring , Andreas Trautner

The even cycle problem for both undirected and directed graphs has been the topic of intense research in the last decade. In this paper, we study the computational complexity of \emph{cycle length modularity problems}. Roughly speaking, in…

Computational Complexity · Computer Science 2007-05-23 Edith Hemaspaandra , Holger Spakowski , Mayur Thakur

The Cycle double cover (CDC) conjecture states that for every bridgeless graph $G$, there exists a family $\mathcal{F}$ of cycles such that each edge of the graph is contained in exactly two members of $\mathcal{F}$. Given an embedding of a…

Combinatorics · Mathematics 2025-11-11 Babak Ghanbari , Robert Šámal

The existence of NAFIL loops of every odd order n => 5 is established by construction. These are non-associative finite invertible loops that are simple and power-associative and they form an infinite family. The first member of this family…

Group Theory · Mathematics 2009-09-02 Raoul E. Cawagas

For a graph (undirected, directed, or mixed), a cycle-factor is a collection of vertex-disjoint cycles covering the entire vertex set. Cycle-factors subject to parity constraints arise naturally in the study of structural graph theory and…

Data Structures and Algorithms · Computer Science 2025-10-22 Florian Hörsch , Csaba Király , Mirabel Mendoza-Cadena , Gyula Pap , Eszter Szabó , Yutaro Yamaguchi

We investigate near-factorizations of nonabelian groups, concentrating on dihedral groups. We show that some known constructions of near-factorizations in dihedral groups yield equivalent near-factorizations. In fact, there are very few…

Group Theory · Mathematics 2025-01-29 Donald L. Kreher , Maura B. Paterson , Douglas R. Stinson

We find new constructions of infinite families of skew Hadamard difference sets in elementary abelian groups under the assumption of the existence of cyclotomic strongly regular graphs. Our construction is based on choosing cyclotomic…

Combinatorics · Mathematics 2012-08-29 Koji Momihara

We construct some analog of cubical Bloch's higher Chow groups. Instead of considering cycles in $X\times\mathbb A^n$ we consider varieties $Y$ over $X$ together with a distinguished element in the $n$-th exterior power of the…

Algebraic Geometry · Mathematics 2024-02-12 Vasily Bolbachan

Structural causal models (SCMs), also known as (nonparametric) structural equation models (SEMs), are widely used for causal modeling purposes. In particular, acyclic SCMs, also known as recursive SEMs, form a well-studied subclass of SCMs…

Methodology · Statistics 2021-11-23 Stephan Bongers , Patrick Forré , Jonas Peters , Joris M. Mooij

We revisit the old idea of constructing difference sets from cyclotomic classes. Two constructions of skew Hadamard difference sets are given in the additive groups of finite fields using unions of cyclotomic classes of order $N=2p_1^m$,…

Combinatorics · Mathematics 2011-09-07 Tao Feng , Qing Xiang

The distance-3 cyclic lowest-density MDS array code (called the C-Code) is a good candidate for RAID 6 because of its optimal storage efficiency, optimal update complexity, optimal length, and cyclic symmetry. In this paper, the underlying…

Information Theory · Computer Science 2015-03-19 Mingqiang Li , Jiwu Shu
‹ Prev 1 3 4 5 6 7 10 Next ›