English
Related papers

Related papers: On circular external difference families

200 papers

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. Let $m=2\ell+1$ for an integer $\ell\geq 1$…

Information Theory · Computer Science 2015-10-20 Cuiling Fan , Nian Li , Zhengchun Zhou

A generalized strong external difference family (briefly $(v, m; k_1,\dots,k_m; \lambda_1,\dots,\lambda_m)$-GSEDF) was introduced by Paterson and Stinson in 2016. In this paper, we construct some new GSEDFs for $m=2$ and use them to obtain…

Combinatorics · Mathematics 2017-11-21 X. Lu , X. Niu , H. Cao

We single out a class of difference families which is widely used in some constructions of Hadamard matrices and which we call Goethals--Seidel (GS) difference families. They consist of four subsets (base blocks) of a finite abelian group…

Combinatorics · Mathematics 2024-01-23 Dragomir Z. Djokovic , Ilias S. Kotsireas

Perfect difference families (PDFs for short) are important both in theoretical and in applications. Perfect difference matrices (PDMs for short) and the equivalent structure had been extensively studied and used to construct perfect…

Information Theory · Computer Science 2021-10-22 Xianwei Sun , Huangsheng Yu , Dianhua Wu

Let \(\cU\) be the multiplicative group of order~\(n\) in the splitting field \(\bbF_{q^m}\) of \(x^n-1\) over the finite field \(\bbF_q\). Any map of the form \(x\rightarrow cx^t\) with \(c\in \cU\) and \(t=q^i\), \(0\leq i<m\), is…

Information Theory · Computer Science 2022-02-17 Henk D. L. Hollmann

In this paper, we provide a mathematical framework for characterizing AMD codes that are R-optimal. We introduce a new combinatorial object, the reciprocally-weighted external difference family (RWEDF), which corresponds precisely to an…

Combinatorics · Mathematics 2018-05-04 Sophie Huczynska , Maura B. Paterson

Cyclic codes are an interesting subclass of linear codes and have been used in consumer electronics, data transmission technologies, broadcast systems, and computer applications due to their efficient encoding and decoding algorithms. In…

Information Theory · Computer Science 2012-07-12 Cunsheng Ding

Frame difference families, which can be obtained via a careful use of cyclotomic conditions attached to strong difference families, play an important role in direct constructions for resolvable balanced incomplete block designs. We…

Combinatorics · Mathematics 2018-02-06 Simone Costa , Tao Feng , Xiaomiao Wang

We introduce a notion of compatibility for families $(\mathcal{F}_{\ell})_{\ell}$ of bounded constructible $\ell$-adic complexes of \'etale sheaves on schemes. For schemes of finite type over a field, this notion is preserved by the usual…

Algebraic Geometry · Mathematics 2021-01-05 Quentin Guignard

We construct several cyclic $(v;k_1,k_2,k_3;\lambda)$ difference families with $v\equiv3 \pmod{4}$ a prime and $\lambda=k_1+k_2+k_3-(3v-1)/4$. Such families can be used in conjunction with the well-known Paley-Todd difference sets to…

Combinatorics · Mathematics 2017-10-12 Dragomir Z. Djokovic , Ilias S. Kotsireas

A \textbf{double-change covering design} (DCCD) is a $v$-set $V$ and an ordered list $\mathcal{L}$ of $b$ blocks of size $k$ where every pair from $V$ must occur in at least one block and each pair of consecutive blocks differs by exactly…

Combinatorics · Mathematics 2025-11-04 Amanda Lynn Chafee , Brett Stevens

The {\em Prym} of a cyclic covering of smooth projective curves is the ``new'' part of the Jacobian: the quotient of the Jacobian of the covering curve by the Jacobians of the intermediate covers. Given a family of such coverings, the…

Number Theory · Mathematics 2025-12-23 Eric M. Rains

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

Cyclic codes are among the most important families of codes in coding theory for both theoretical and practical reasons. Despite their prominence and intensive research on cyclic codes for over a half century, there are still open problems…

Information Theory · Computer Science 2021-07-02 Nuh Aydin , R. Oliver VandenBerg

For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to making short cycles. Also, the existing high-rate quasi-cyclic…

Information Theory · Computer Science 2016-11-18 Hosung Park , Seokbeom Hong , Jong-Seon No , Dong-Joon Shin

We construct two difference families on each of the cyclic groups of order 109, 145 and 247, and use them to construct skew-Hadamard matrices of orders 436, 580 and 988. Such difference families and matrices are constructed here for the…

Combinatorics · Mathematics 2009-03-18 Dragomir Z. Djokovic

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…

Information Theory · Computer Science 2023-05-03 Tingfang Chen , Cunsheng Ding , Chengju Li , Zhonghua Sun

Cyclic codes are a subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics due to their efficient encoding and decoding algorithms. Let $\alpha $ be a generator of…

Information Theory · Computer Science 2024-07-11 Gaofei Wu , Zhuohui You , Zhengbang Zha , Yuqing Zhang

Using cyclotomic classes of order twelve for certain finite fields, we construct an infinite family of almost difference sets and normally regular graphs applying the theory of cyclotomy. We show that in each of these fields neither the…

Combinatorics · Mathematics 2013-10-16 Kathleen Nowak , Oktay Olmez , Sung Y. Song

A $(v,k,\lambda, \mu)$-partial difference set (PDS) is a subset $D$ of a group $G$ such that $|G| = v$, $|D| = k$, and every nonidentity element $x$ of $G$ can be written in either $\lambda$ or $\mu$ different ways as a product $gh^{-1}$,…

Combinatorics · Mathematics 2023-07-31 James Davis , John Polhill , Ken Smith , Eric Swartz