Related papers: On the classification of $\mathbb{Z}_4$-codes
For any permutation w, we characterize the reduced words of w that are their own commutation class. When w is the long element n(n-1)...321 and n \ge 4, there are exactly four such words.
We present an algorithm for the classification of linear codes over finite fields, based on lattice point enumeration. We validate a correct implementation of our algorithm with known classification results from the literature, which we…
A toric code is an error-correcting code determined by a toric variety or its associated integral convex polytope. We investigate $4$- and $5$-dimensional toric $3$-fold codes, which are codes arising from polytopes in $\mathbf{R}^3$ with…
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…
In this note, we establish a mass formula for self-orthogonal codes over Z_{p^2}, where p is a prime. As a consequence, an alternative proof of the known mass formulas for self-dual codes over Z_{p^2} is obtained. We also establish a mass…
We establish an explicit formula for the type number of quaternion orders of level $(N_1, N_2)$, where $N_1 = p_1^{2u_1+1} \cdots p_w^{2u_w+1}$ (with $u_i \geq 0$ and $w$ odd) and $\gcd(N_1, N_2) = 1$. Our main result generalizes Pizer's…
In this paper a wide family of identifying codes over regular Cayley graphs of degree four which are built over finite Abelian groups is presented. Some of the codes in this construction are also perfect. The graphs considered include some…
Best and Brouwer [Discrete Math. 17 (1977), 235-245] proved that triply-shortened and doubly-shortened binary Hamming codes (which have length $2^m-4$ and $2^m-3$, respectively) are optimal. Properties of such codes are here studied,…
We classify group gradings on the simple Lie algebra $L$ of type $D_4$ over an algebraically closed field of characteristic different from 2: fine gradings up to equivalence and $G$-gradings, with a fixed group $G$, up to isomorphism. For…
A code $C \subseteq \{0, 1, 2\}^n$ of length $n$ is called trifferent if for any three distinct elements of $C$ there exists a coordinate in which they all differ. By $T(n)$ we denote the maximum cardinality of trifferent codes with length.…
Constant dimension codes are e.g. used for error correction and detection in random linear network coding, so that constructions for these codes have achieved wide attention. Here, we improve over 150 lower bounds by describing better…
Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in…
An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…
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…
We show an interesting PBD-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes…
We describe four fine gradings on the real form $\mathfrak e_{6,-26}$. They are precisely the gradings whose complexifications are fine gradings on the complexified algebra $\mathfrak{e}_6$. The universal grading groups are $\mathbb Z_2^6$,…
A code $C$ is called $\Z_p\Z_{p^2}$-linear if it is the Gray image of a $\Z_p\Z_{p^2}$-additive code, where $p>2$ is prime. In this paper, the rank and the dimension of the kernel of $\Z_p\Z_{p^2}$-linear codes are studied. Two bounds of…
We classify all $q$-ary $\Delta$-divisible linear codes which are spanned by codewords of weight $\Delta$. The basic building blocks are the simplex codes, and for $q=2$ additionally the first order Reed-Muller codes and the parity check…
In the present paper, we are interested in classifying of Collatz sequences on based to the different behavior of these sequences when their lengths tend to infinity. A Collatz infinite sequence can be defined as an infinite ordered set of…
One peculiarity with deletion-correcting codes is that perfect $t$-deletion-correcting codes of the same length over the same alphabet can have different numbers of codewords, because the balls of radius $t$ with respect to the…