English
Related papers

Related papers: Semi-cyclic holey group divisible designs with blo…

200 papers

In this paper we provide a $4$-GDD of type $2^2 5^5$, thereby solving the existence question for the last remaining feasible type for a $4$-GDD with no more than $30$ points. We then show that $4$-GDDs of type $2^t 5^s$ exist for all but a…

Combinatorics · Mathematics 2024-01-23 R. Julian R. Abel , Thomas Britz , Yudhistira A. Bunjamin , Diana Combe

This paper focuses on constructions for optimal $2$-D $(n\times m,3,2,1)$-optical orthogonal codes with $m\equiv 0\ ({\rm mod}\ 4)$. An upper bound on the size of such codes is established. It relies heavily on the size of optimal…

Combinatorics · Mathematics 2018-04-13 Tao Feng , Lidong Wang , Xiaomiao Wang

An Orthogonally resolvable Matching Design OMD$(n, k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, called blocks, such that the blocks can be resolved in two different ways. Such a design can be…

Combinatorics · Mathematics 2017-07-21 Peter Danziger , Sophia Park

Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, based on almost difference sets and cyclic difference matrices,…

Information Theory · Computer Science 2016-11-17 Yeow Meng Chee , Alan C. H. Ling , Jianxing Yin

Recently, a construction of group divisible designs (GDDs) derived from the decoding of quadratic residue (QR) codes was given. In this paper, we extend the idea to obtain a new family of GDDs, which is also involved with a well-known…

Combinatorics · Mathematics 2018-09-05 Yu-pei Huang , Chia-an Liu , Yaotsu Chang , Chong-Dao Lee

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems and communication systems as they have efficient encoding and decoding algorithms. In this paper, we settle an open problem…

Combinatorics · Mathematics 2019-01-25 Dongchun Han , Haode Yan

We give improved lower bounds for binary $3$-query locally correctable codes (3-LCCs) $C \colon \{0,1\}^k \rightarrow \{0,1\}^n$. Specifically, we prove: (1) If $C$ is a linear design 3-LCC, then $n \geq 2^{(1 - o(1))\sqrt{k} }$. A design…

Computational Complexity · Computer Science 2024-10-29 Pravesh K. Kothari , Peter Manohar

We define a pseudo quasi-3 design as a symmetric design with the property that the derived and residual designs with respect to at least one block are quasi-symmetric. Quasi-symmetric designs can be used to construct optimal self…

Combinatorics · Mathematics 2008-04-11 Carl Bracken

Let $G_{(m,3,r)}=\langle x,y\mid x^m=1, y^3=1,yx=x^ry\rangle$ be a metacyclic group of order $3m$, where ${\rm gcd}(m,r)=1$, $1<r<m$ and $r^3\equiv 1$ (mod $m$). Then left ideals of the group algebra $\mathbb{F}_q[G_{(m,3,r)}]$ are called…

Information Theory · Computer Science 2016-06-17 Cao Yonglin , Cao Yuan , Fu Fang-Wei , Gao Jian

Cyclic codes are an important subclass of linear codes with wide applications in communication systems and data storage systems. In 2013, Ding and Helleseth presented nine open problems on optimal ternary cyclic codes $\mathcal{C}_{(1,e)}$.…

Information Theory · Computer Science 2026-01-21 Jingjun Bao , Hanlin Zou

We consider codes over the two semi-local non-unital rings of order six, \[ H_{23} = \langle a,b \mid 2a=0, 3b = 0, a^2=a, b^2 = 0, ab = 0 = ba \rangle,\] and \[H_{32} = \langle a,b \mid 2a=0, 3b = 0, a^2=0, b^2 = b, ab = 0 = ba \rangle. \]…

Rings and Algebras · Mathematics 2025-08-25 Altaf Alshuhail

This work studies skew polycyclic codes over finite chain rings defined by central trinomials. For this class of codes, we investigate Hamming equivalence in the non-commutative (skew) setting. We introduce an equivalence relation on the…

Information Theory · Computer Science 2026-05-06 Maryam Bajalan , Edgar Martínez-Moro , Hassan Ou-azzou

This paper addresses the problem of finding $Q_{m,t}\left(n\right)$, the number of possible ways to partition any member $n$ of the cyclic group $\mathbb{Z}/m\mathbb{Z}$ into $t$ distinct parts. When $m$ is odd, it was previously known that…

Combinatorics · Mathematics 2019-06-04 Steven S Poon

The dimension of a block design is the maximum positive integer $d$ such that any $d$ of its points are contained in a proper subdesign. Pairwise balanced designs PBD$(v,K)$ have dimension at least two as long as not all points are on the…

Combinatorics · Mathematics 2019-07-22 Coen del Valle , Peter J. Dukes

We compute the integral cohomology rings of a family of 3-groups. As a corollary, we exhibit, for each n greater than or equal to 5, a pair of groups of order 3^n whose integral cohomology rings are isomorphic.

Algebraic Topology · Mathematics 2007-12-03 Ian J. Leary

We characterize semigroups in $\{0,1,2,\ldots\}$ of matricial dimension $2$ and produce a counterexample to the conjecture that a numerical semigroup whose small elements are lonely has matricial dimension at most $2$.

Combinatorics · Mathematics 2025-06-16 Arsh Chhabra , Stephan Ramon Garcia

We provide a method to construct $t$-designs from weighing matrices and association schemes. One instance of our method can produce a $3$-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to…

Combinatorics · Mathematics 2026-04-14 Gary Greaves , Sho Suda

We show that every finite-dimensional pointed Hopf algebra over a finite simple Chevalley group, different from $PSL_2(q)$ with q= 3 mod 4 (and from $PSL_3(2)\simeq PSL_2(7)$), is isomorphic to the corresponding group algebra. To do this,…

Quantum Algebra · Mathematics 2026-03-16 Nicolás Andruskiewitsch , Giovanna Carnovale

Circular external difference families (CEDFs) are a recently-introduced variation of external difference families with applications to non-malleable threshold schemes: a $(v,m,\ell,1)$-CEDF is an $m$-sequence $(A_0, \ldots, A_{m-1})$ of…

Combinatorics · Mathematics 2026-04-10 A. Burgess , F. Merola , T. Traetta

If the Krull dimension of the semigroup ring is greater than one, then affine semigroups of maximal projective dimension ($\mathrm{MPD}$) are not Cohen-Macaulay, but they may be Buchsbaum. We give a necessary and sufficient condition for…

Commutative Algebra · Mathematics 2023-07-20 Om Prakash Bhardwaj , Indranath Sengupta