Related papers: Minimal Binary Abelian Codes of length $p^m q^n$
In this work, we define a modification of a bordered construction for self-dual codes which utilises $\lambda$-circulant matrices. We provide the necessary conditions for the construction to produce self-dual codes over finite commutative…
We prove that for positive integers $m \geq 1, n \geq 1$ and a prime number $p \neq 2,3$ there are finitely many finite $m$-generated Moufang loops of exponent $p^n$.
Let $p$ be a prime number and $s> 0$ an integer. In this short note, we investigate one-point geometric Goppa codes associated with an elementary abelian $p$-extension of $\mathbb{F}_{p^{s}}(x)$. We determine their dimension and the exact…
We extend results of Videla and Fukuzaki to define algebraic integers in large classes of infinite algebraic extensions of Q and use these definitions for some of the fields to show the first-order undecidability. We also obtain a…
Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…
A new method for the construction of the binary quantum stabilizer codes is provided, where the construction is based on Abelian and non-Abelian groups association schemes. The association schemes based on non-Abelian groups are constructed…
In this paper, for an odd prime power $q$, we extend the construction of Xie et al. \cite{XOYM2023} to propose two classes of linear codes $\mathcal{C}_{Q}$ and $\mathcal{C}_{Q}'$ over the finite field $\mathbb{F}_{q}$ with at most four…
Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…
In this note, we construct new doubly even self-dual codes having minimum weight $20$ for lengths $112$, $120$ and $128$. This implies that there are at least three inequivalent extremal doubly even self-dual codes of length $112$.
Minimal codes are a class of linear codes which gained interest in the last years, thanks to their connections to secret sharing schemes. In this paper we provide the weight distribution and the parameters of families of minimal codes…
In this paper, we define Abelian and consta-Abelian polyadic codes over rings defined as affine algebras over chain rings. For that aim, we use the classical construction via splittings and multipliers of the underlying Abelian group. We…
In this paper, we study the codes $\mathcal C_k(n,q)$ arising from the incidence of points and $k$-spaces in $\text{PG}(n,q)$ over the field $\mathbb F_p$, with $q = p^h$, $p$ prime. We classify all codewords of minimum weight of the dual…
Linear codes with few weights have been a significant area of research in coding theory for many years, due to their applications in secret sharing schemes, authentication codes, association schemes, and strongly regular graphs. Inspired by…
Let $q\ne \pm1,v^2$ be a fixed integer, and let $x\geq 1$ be a large number. The least prime number $p \geq3 $ such that $q$ is a primitive root modulo $p$ is conjectured to be $p\ll (\log q)(\log \log q)^3),$ where $\gcd(p,q)=1$. This note…
We address the question of constructing explicitly quasi-uniform codes from groups. We determine the size of the codebook, the alphabet and the minimum distance as a function of the corresponding group, both for abelian and some nonabelian…
We introduce Berman-intersection-dual Berman (BiD) codes. These are abelian codes of length $3^m$ that can be constructed using Kronecker products of a $3 \times 3$ kernel matrix. BiD codes offer minimum distance close to that of…
We construct new $s$-extremal singly even self-dual codes of minimum weights $8,10,12$ and $14$. We also give tables for the currently known results on the existence of $s$-extremal singly even self-dual codes of minimum weights $8,10,12$…
Minimal Q-graded subalgebras of semisimple Lie algebras are introduced, and it is proved that their derived algebras are abelian. Almost inner derivations of minimal Q-graded subalgebras are investigated, they are all inner derivations.…
The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect. Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes…
Fici and Saarela ([2]) conjectured that a binary word of length n contains at least $\lfloor n/4 \rfloor$ abelian squares. We slightly extend this conjecture and show that it holds in some special cases. In all other cases we have the…