相关论文: Cyclic (v;r,s;lambda) difference families with two…
In this paper, we introduce a new family of symmetric polynomials which depends on a parameter r. They are defined by specifying certain of their zeros. For the parameter values 1/2, 1, and 2 they have an interpretation in terms of Capelli…
We establish a complete classification of binary group codes with complementary duals for a finite group and explicitly determine the number of linear complementary dual (LCD) cyclic group codes by using cyclotomic cosets. The dimension and…
Understanding the multiplicity of stellar systems and the correlations between their hierarchical components provides crucial insights into star formation processes. If binary companions form independently in each component of a wide binary…
Cyclic codes are an interesting family of linear codes since they have efficient decoding algorithms and contain optimal codes as subfamilies. Constructing infinite families of cyclic codes with good parameters is important in both theory…
This paper investigates $2$-$(v,5,\lambda)$ designs $\mathcal{D}$ admitting a block-transitive automorphism group $G$. We first prove that if $G$ is point-imprimitive, then $v$ must be one of 16, 21, or 81. We further provide a complete…
In this paper we investigate the class of constacyclic codes, which is a natural generalization of the class of cyclic and negacyclic codes. This class of codes is interesting in the sense that it contains codes with good or even optimal…
BCH and LCD cyclic codes of length $n=\lambda(q^m+1)$ with $\lambda\mid q-1$ are studied. A complete characterization of $q$-cyclotomic cosets modulo $n$ is given: Theorem \ref{th4} provides a necessary and sufficient condition for any…
Our main objective is to show that the computational methods that we previously developed to search for difference families in cyclic groups can be fully extended to the more general case of arbitrary finite abelian groups. In particular…
We give here new O-C diagrams of the two classical Cepheids RY Cas and V Lac, established on a large basis of times of maximum of light, which covers more than a century. These two Cepheids present a variation of their period for which it…
We present a construction method of BIB-designs from a finite group G and a group of automorphisms \Phi on G such that |\Phi(x)| = |\Phi| for all x in G, x <> 0. By using a generalization of the concept of a difference family we can so…
Single sequences like Legendre have high linear complexity. Known CDMA families of sequences all have low complexities. We present a new method of constructing CDMA sequence sets with the complexity of the Legendre from new frequency hop…
We construct a strongly regular graph with the parameters (65; 32; 15; 16). The idea is to search for an adjacency matrix that consists of circulant blocks. Equations with such matrices can be reduced to congruences with polynomials…
We study bifurcations in finite-parameter families of vector fields on $S^2$. Recent papers by Yu. Ilyashenko, N. Goncharuk, Yu. Kudryashov, I. Schurov, and N. Solodovnikov provide examples of (locally generic) structurally unstable…
Roughly speaking, an $(n,(r,s))$-Cover Free Family (CFF) is a small set of $n$-bit strings such that: "in any $d:=r+s$ indices we see all patterns of weight $r$". CFFs have been of interest for a long time both in discrete mathematics as…
In this paper we introduce and investigate a one-parameter family of polynomials. They are semisymmetric, i.e. symmetric in the variables with odd and even index separately. In fact, the family forms a basis of the space of semisymmetric…
Given any digraph $D$ without loops or multiple arcs, there is a natural construction of a semigroup $\langle D\rangle$ of transformations. To every arc $(a,b)$ of $D$ is associated the idempotent transformation $(a\to b)$ mapping $a$ to…
An orientable sequence of order $n$ over an alphabet $\{0,1,\ldots, k{-}1\}$ is a cyclic sequence such that each length-$n$ substring appears at most once \emph{in either direction}. When $k= 2$, efficient algorithms are known to construct…
For each member $\mathcal{A}$ of a family of linear cycle sets whose underlying abelian group is cyclic of order a power of a prime number, we compute all the central extensions of $\mathcal{A}$ by an arbitrary abelian group.
Davis and Jedwab (1997) established a great construction theory unifying many previously known constructions of difference sets, relative difference sets and divisible difference sets. They introduced the concept of building blocks, which…
Motivated by a connection between semi-regular relative difference sets and mutually unbiased bases, we study relative difference sets with parameters $(m,n,m,m/n)$ in groups of non-prime-power orders. Let $p$ be an odd prime. We prove that…