Related papers: The nonexistence of an additive quaternary [15,5,9…
The main result in this paper is the proof of the recently conjectured non-existence of cubic Legendre multiplier sequences. We also give an alternative proof of the non-existence of linear Legendre multiplier sequences, using a method that…
We show that the maximum cardinality of an equiangular line system in $\mathbb R^{18}$ is at most $59$. Our proof includes a novel application of the Jacobi identity for complementary subgraphs. In particular, we show that there does not…
In 1976, Dekking showed that there exists an infinite binary word that contains neither squares yy with y >= 4 nor cubes xxx. We show that `cube' can be replaced by any fractional power > 5/2. We also consider the analogous problem where…
The study of good nonregular fractional factorial designs has received significant attention over the last two decades. Recent research indicates that designs constructed from quaternary codes (QC) are very promising in this regard. The…
Consider a $q$-ary block code satisfying the property that no $l$-letters long codeword's prefix occurs as a suffix of any codeword for $l$ inside some interval. We determine a general upper bound on the maximum size of these codes and a…
We investigate additive codes, defined as $\mathbb{F}_q$-linear subspaces $C \subseteq \mathbb{F}_{q^h}^n$ of length $n$ and dimension $r$ over $\mathbb{F}_q$. An additive code is said to be of type $[n, r/h, d]_q^h$, where $d$ denotes the…
We study the combinatorial function $L(k,q),$ the maximum number of nonzero weights a linear code of dimension $k$ over $\F_q$ can have. We determine it completely for $q=2,$ and for $k=2,$ and provide upper and lower bounds in the general…
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…
For a group $G$ acting on an affine variety $X$, the separating variety is the closed subvariety of $X\times X$ encoding which points of $X$ are separated by invariants. We concentrate on the indecomposable rational linear representations…
We compare the implementation of a 8x8 bit multiplier with two different implementations of a 4x4 quaternary digit multiplier. Interfacing this binary multiplier with quaternary to binary decoders and binary to quaternary encoders leads to…
In this paper, we prove that there does not exist $F \in \mathbb{Q}[x,y]$ of degree $4$ such that $F(\mathbb{Z}^2) = \mathbb{Z}_{\geq 0}$. In particular, this answers a question by John S. Lew and Bjorn Poonen for quartic polynomials.
For every positive integer k, it is shown that there exists a positive definite diagonal quaternary integral quadratic form that represents all positive integers except for precisely those which lie in k arithmetic progressions. For k=1,…
We construct new linear codes with high minimum distance d. In at least 12 cases these codes improve the minimum distance of the previously known best linear codes for fixed parameters n,k. Among these new codes there is an optimal ternary…
We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of $(h-1)$-spaces in PG$(2,q)$, such that no hyperplane…
Let $\mathcal{X}$ be a set of $(h-1)$-dimensional subspaces of $\mathrm{PG}(kh-1,q)$ with the property that every hyperplane contains at most $t$ elements of $\mathcal{X}$. We prove the upper bound $|\mathcal{X}| \leq (t-k+2)q^h + t$, and…
A basic problem for constant dimension codes is to determine the maximum possible size $A_q(n,d;k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$, called codewords, such that the subspace distance satisfies…
We study the maximum length of $q$-ary codes as a function of alphabet size, code size, and Singleton defect. For an $(n, M, d)_q$ code with dimension $\kappa = \log_q M \ge 2$ and Singleton defect $s = n - \lceil\kappa\rceil + 1 - d$, we…
This is the TeX version of the {\it Mathematica} file used to prove there is no Type II binary code with parameters [72, 36, 16] or [96, 48, 20].
We study the extensibility of $D(4)$-pairs $\{a,b\}$, where $b = ka$ and $k \in \{7,8,10,11,12,13\}$. Firstly, we show that it can be extended to a $D(4)$-triple with an element c, which is a member of a family of positive integers…
Linear complementary dual (LCD) codes can provide an optimum linear coding solution for the two-user binary adder channel. LCD codes also can be used to against side-channel attacks and fault non-invasive attacks. Let $d_{LCD}(n, k)$ denote…