English
Related papers

Related papers: Three New Families of Zero-difference Balanced Fun…

200 papers

Zero-difference balanced (ZDB) functions can be employed in many applications, e.g., optimal constant composition codes, optimal and perfect difference systems of sets, optimal frequency hopping sequences, etc. In this paper, two results…

Information Theory · Computer Science 2013-10-29 Qi Wang , Yue Zhou

A function $f$ from an Abelian group $(A,+)$ to an Abelian group $(B,+)$ is $(n, m, S)$ zero-difference (ZD), if $S=\{\lambda_\alpha \mid \alpha \in A\setminus\{0\}\}$ where $n=|A|$, $m=|f(A)|$ and $\lambda_\alpha=|\{x \in A \mid…

Combinatorics · Mathematics 2026-01-01 Zongxiang Yi , Dingyi Pei , ChunmingTang

Notes on two constructions of zero-difference balanced (ZDB) functions are made in this letter. Then ZDB functions over $\mathbb{Z}_{e}\times \prod_{i=0}^{k}{\mathbb{F}_{q_i}}$ are obtained. And it shows that all the known ZDB functions…

Information Theory · Computer Science 2019-04-03 Zongxiang Yi , Yuyin Yu , Chunming Tang , Yanbin Zheng

The construction of perfect hash functions is a well-studied topic. In this paper, this concept is generalized with the following definition. We say that a family of functions from $[n]$ to $[k]$ is a $\delta$-balanced $(n,k)$-family of…

Data Structures and Algorithms · Computer Science 2008-12-18 Noga Alon , Shai Gutner

Let $F$ be a function from $\mathbb{F}_{p^n}$ to itself and $\delta$ a positive integer. $F$ is called zero-difference $\delta$-balanced if the equation $F(x+a)-F(x)=0$ has exactly $\delta$ solutions for all non-zero $a\in\mathbb{F}_{p^n}$.…

Information Theory · Computer Science 2014-11-03 Claude Carlet , Guang Gong , Yin Tan

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 propose a novel zero-order control barrier function (ZOCBF) for sampled-data systems to ensure system safety. Our formulation generalizes conventional control barrier functions and straightforwardly handles safety constraints with…

Systems and Control · Electrical Eng. & Systems 2025-04-10 Xiao Tan , Ersin Das , Aaron D. Ames , Joel W. Burdick

In this paper, six constructions of difference families are presented. These constructions make use of difference sets, almost difference sets and disjoint difference families, and give new point of views of relationships among these…

Information Theory · Computer Science 2014-11-14 Cunsheng Ding , Chik How Tan , Yin Tan

A generic method to construct zero-difference functions (ZDFs) on algebraic rings is proposed in this paper. Then this method is used over some rings $\mathbb{Z}_{p^k}$, where $p$ is a prime number and $k\ge 2$ is a positive integer, and…

Combinatorics · Mathematics 2019-08-27 Zongxiang Yi

Sequences with optimal correlation properties are much sought after for applications in communication systems. In 1980, Alltop (IEEE Trans. Inf. Theory 26(3):350-354, 1980) described a set of sequences based on a cubic function and showed…

Combinatorics · Mathematics 2013-12-04 Joanne L. Hall , Asha Rao , Stephen M. Gagola

Recently, new combinatorial structures called disjoint partial difference families (DPDFs) and external partial difference families (EPDFs) were introduced, which simultaneously generalize partial difference sets, disjoint difference…

Combinatorics · Mathematics 2023-05-12 S. Huczynska , L. M. Johnson

Zero-suppressed binary decision diagrams (ZDDs) are a data structure representing Boolean functions, and one of the most successful variants of binary decision diagrams (BDDs). On the other hand, BDDs are also called branching programs in…

Computational Complexity · Computer Science 2016-02-26 Hiroki Morizumi

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

Planar functions over finite fields give rise to finite projective planes. They were also used in the constructions of DES-like iterated ciphers, error-correcting codes, and codebooks. They were originally defined only in finite fields with…

Information Theory · Computer Science 2016-09-06 Longjiang Qu

Boolean functions with few-valued spectra have wide applications in cryptography, coding theory, sequence designs, etc. In this paper, we further study the parametric construction approach to obtain balanced Boolean functions using…

Information Theory · Computer Science 2025-06-25 Qiancheng Zhang , Kangquan Li , Longjiang Qu

External difference families (EDFs) are combinatorial objects which were introduced in the early 2000s, motivated by information security applications such as the construction of AMD codes. Various generalizations have since been defined…

Combinatorics · Mathematics 2025-11-04 Sophie Huczynska , Christopher Jefferson , Struan McCartney

We discuss functions from edges and vertices of an undirected graph to an Abelian group. Such functions, when the sum of their values along any cycle is zero, are called balanced labelings. The set of balanced labelings forms an Abelian…

Combinatorics · Mathematics 2013-06-28 Yonah Cherniavsky , Avraham Goldstein , Vadim E. Levit

In this article, we introduce two families of novel fractional $\theta$-methods by constructing some new generating functions to discretize the Riemann-Liouville fractional calculus operator $\mathit{I}^{\alpha}$ with a second order…

Numerical Analysis · Mathematics 2024-10-07 BaoLi Yin , Yang Liu , Hong Li , Zhimin Zhang

Multidimensional population balance models (PBMs) describe chemical and biological processes having a distribution over two or more intrinsic properties (such as size and age, or two independent spatial variables). The incorporation of…

Computational Engineering, Finance, and Science · Computer Science 2025-04-29 Pavan Inguva , Richard D. Braatz

This paper studies a difference between Binary Decision Diagrams (BDDs) and Zero-suppressed BDDs (ZDDs) from a conceptual point of view. It is commonly understood that a BDD is a representation of a Boolean function, whereas a ZDD is a…

Logic in Computer Science · Computer Science 2018-06-28 Kensuke Kojima
‹ Prev 1 2 3 10 Next ›