Balanced \(( \mathbb{Z}_{2u}\times \mathbb{Z}_{38v}, \{3, 4, 5\}, 1)\) difference packings and related codes (Q6089459)
From MaRDI portal
scientific article; zbMATH DE number 7778575
Language | Label | Description | Also known as |
---|---|---|---|
English | Balanced \(( \mathbb{Z}_{2u}\times \mathbb{Z}_{38v}, \{3, 4, 5\}, 1)\) difference packings and related codes |
scientific article; zbMATH DE number 7778575 |
Statements
Balanced \(( \mathbb{Z}_{2u}\times \mathbb{Z}_{38v}, \{3, 4, 5\}, 1)\) difference packings and related codes (English)
0 references
14 December 2023
0 references
The objects under investigation in this paper are balanced \((m,n,K,\lambda)\)-OOSPC, where the acronym stands for `optical orthogonal signature pattern code'. Here, \(m\), \(n\), \(\lambda\) are positive integers, and \(K\) is a set of positive integers. An OOSPC as above is a family \(C\) of subsets of \(\mathbb{Z}_m \times \mathbb{Z}_n\) with the following properties: \begin{itemize} \item[(1)] For any \(X \in C\), \(|X| \in K\); furthermore, the balanced property stipulates that every value in \(K\) occurs equally often among the elements of \(C\); \item[(2)] For any \(X \in C\), \(|X \cap (X+\mathfrak{t})| \le \lambda\) for every translate \(\mathfrak{t} \in \mathbb{Z}_m \times \mathbb{Z}_n \setminus \{(0,0)\}\); and \item[(3)] For any distinct \(X,Y \in C\), \(|X \cap (X+\mathfrak{t})| \le \lambda\) for every translate \(\mathfrak{t} \in \mathbb{Z}_m \times \mathbb{Z}_n\). \end{itemize} Note that (2) can be viewed as a two-dimensional auto-correlation condition, while (3) is a cross-correlation condition. This paper uses balanced difference packings with structured leaves to construct balanced OOSPC. The main result is Theorem 1.2, which gives the existence of these objects for parameters \((m,n,K,\lambda) = (2u,38v,\{3,4,5\},1)\), where \(u\), \(v\) are odd integers at least \(3\). It is not entirely clear what motivates these specific parameters, but constructions are also given for certain other \(m\) and \(n\), still for \(K=\{3,4,5\}\) and \(\lambda=1\). Sections 3 and 4 contain a summary of recursive constructions that may be useful for future work investigating new parameters.
0 references
balanced
0 references
difference matrix
0 references
difference packing
0 references
optical orthogonal signature pattern code
0 references
semi-cyclic group divisible design
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references