Related papers: On the classification of $\mathbb{Z}_4$-codes

Let $A$ be a real quadratic order of discriminant $p$ or $4p$ with a prime $p$. In this paper we classify all proper totally imaginary quadratic $A$-orders $B$ with index $w(B)=[B^\times: A^\times]>1$. We also calculate numerical invariants…

Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying certain conditions. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes…

We consider the problem of encoding two-dimensional arrays, whose elements come from a total order, for answering \topk{} queries. The aim is to obtain encodings that use space close to the information-theoretic lower bound, which can be…

We classify certain $\mathbb{Z}_2 $-graded extensions of generalized Haagerup categories in terms of numerical invariants satisfying polynomial equations. In particular, we construct a number of new examples of fusion categories, including:…

A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 was recently carried out in [P. R. J. \"Osterg{\aa}rd and O. Pottonen, "The perfect binary one-error-correcting…

Using geometric methods for linearizing systems of second order cubically semi-linear ordinary differential equations and third order quintically semi-linear ordinary differential equations, we extend to the fourth order by differentiating…

It has been proven in a series of works that the order of the automorphism group of a binary [72,36,16] code does not exceed five. We obtain a parametrization of all self-dual binary codes of length 72 with automorphism of order 4 which can…

In this manuscript, we construct a class of projective three-weight linear codes and two classes of projective four-weight linear codes over F2 from the defining sets construction, and determine their weight distributions by using additive…

Let $p$ be a prime integer, $n,s\geq 2$ be integers satisfying ${\rm gcd}(p,n)=1$, and denote $R=\mathbb{Z}_{p^s}[v]/\langle v^2-pv\rangle$. Then $R$ is a local non-principal ideal ring of $p^{2s}$ elements. First, the structure of any…

In this paper, an explicit representation and enumeration for negacyclic codes of length $2^kn$ over the local non-principal ideal ring $R=\mathbb{Z}_4+u\mathbb{Z}_4$ $(u^2=0)$ is provided, where $k, n$ are any positive integers and $n$ is…

This paper aims to construct optimal quaternary additive codes with non-integer dimensions. Firstly, we propose combinatorial constructions of quaternary additive constant-weight codes, alongside additive generalized anticode construction.…

A ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive code ${\cal C}\subseteq{\mathbb{Z}}_2^\alpha\times{\mathbb{Z}}_4^\beta$ is called cyclic if the set of coordinates can be partitioned into two subsets, the set of ${\mathbb{Z}}_2$ and the set of…

The descriptions (up to isomorphism) of naturally graded $p$-filiform Leibniz algebras and $p$-filiform ($p\leq 3$) Leibniz algebras of maximum length are known. In this paper we study the gradation of maximum length for $p$-filiform…

All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact…

This paper presents four new classes of binary quantum codes with minimum dis- tance 3 and 4, namely Class-I, Class-II, Class-III and Class-IV. The classes Class-I and Class-II are constructed based on self-dual orientable embeddings of the…

We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible complexity.

In this paper, first, we define and investigate $k$-layered numbers, which are a generalization of Zumkeller numbers. After that, we generalize the concept of Zumkeller labeling and Zumkeller cordial labeling to $k$-layered labeling and…

Let $n_k(s)$ be the maximal length $n$ such that a quaternary additive $[n,k,n-s]_4$-code exists. We solve a natural asymptotic problem by determining the lim sup $\lambda_k$ of $n_k(s)/s,$ and the smallest value of $s$ such that…

We classify all binary error correcting completely regular codes of length $n$ with minimum distance $\delta>n/2$.

We investigate the large values of class numbers of cubic fields, showing that one can find arbitrary long sequences of "close" abelian cubic number fields with class numbers as large as possible. We also give a first step toward an…