Related papers: All binary linear codes that are invariant under $…
For \ell \neq p odd primes, we examine PSL_2(\ell)-covers of the projective line branched at one point over an algebraically closed field of characteristic p, where PSL_2(\ell) has order divisible by p. We show that such covers can be…
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…
We compare ordinary and symmetric variants of two classical measures of pseudorandomness for binary sequences, the $2$-adic complexity and the linear complexity. In the periodic setting, we show that for binary periodic sequences…
The classical way of extending an $[n, k, d]$ linear code $\C$ is to add an overall parity-check coordinate to each codeword of the linear code $\C$. This extended code, denoted by $\overline{\C}(-\bone)$ and called the standardly extended…
Self-orthogonal codes are of interest as they have important applications in quantum codes, lattices and many areas. In this paper, based on the weakly regular plateaued functions or plateaued Boolean functions, we construct a family of…
It has long been envisioned that the strength of the barcode invariant of filtered cellular complexes could be increased using cohomology operations. Leveraging recent advances in the computation of Steenrod squares, we introduce a new…
Let $q$ be a power of a prime $p$. In this paper, we study reversible cyclic codes of arbitrary length over the ring $ R = \mathbb{F}_q + u \mathbb{F}_q$, where $u^2=0 mod q$. First, we find a unique set of generators for cyclic codes over…
We prove the following results regarding the linear solvability of networks over various alphabets. For any network, the following are equivalent: (i) vector linear solvability over some finite field, (ii) scalar linear solvability over…
We consider quantum two-block group algebra (2BGA) codes, a previously unstudied family of smallest lifted-product (LP) codes. These codes are related to generalized-bicycle (GB) codes, except a cyclic group is replaced with an arbitrary…
A binary code of blocklength $n$ and codebook size $M$ is called an $(n,M)$ code, which is studied for memoryless binary symmetric channels (BSCs) with the maximum likelihood (ML) decoding. For any $n \geq 2$, some optimal codes among the…
Let $\mathcal{D}=(\mathcal{P},\mathcal{B})$ be a non-trivial block-transitive $t$-$(k^2,k,\lambda)$ design with $G\leq \Aut(\mathcal{D})$ and $X\unlhd G\leq \Aut(X)$, where $X=PSL(n,q)(n\geq3).$ We prove that $t=2$ and the parameters…
For the category of group codes, that generalizes the category of linear codes over a finite field, and with the generalized notions of direct sums and ndecomposable group codes, we prove that every MDS non trivial code, every perfect non…
In two previous papers we constructed new families of completely regular codes by concatenation methods. Here we determine cases in which the new codes are completely transitive. For these cases we also find the automorphism groups of such…
The square $C^{*2}$ of a linear error correcting code $C$ is the linear code spanned by the component-wise products of every pair of (non-necessarily distinct) words in $C$. Squares of codes have gained attention for several applications…
Linear codes are the most important family of codes in cryptography and coding theory. Some codes have only a few weights and are widely used in many areas, such as authentication codes, secret sharing schemes and strongly regular graphs.…
In this paper, we introduce code distances, a new family of invariants for linear codes. We establish some properties and prove bounds on the code distances, and show that they are not invariants of the matroid (for a linear block code) or…
Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such…
In this article we provide a classification of the projective transformations in $PSL(n+1,\Bbb{C})$ considered as automorphisms of the complex projective space $\Bbb{P}^n$. Our classification is an interplay between algebra and dynamics,…
In this paper we study $\prod\limits_{i=1}^{n} \mathbb{Z}_{2^i}$-Additive Cyclic Codes. These codes are identified as $\mathbb{Z}_{2^n}[x]$-submodules of $\prod\limits_{i=1}^{n}\mathbb{Z}_{2^i}[x]/ \langle x^{\alpha_i}-1\rangle$; $\alpha_i$…
Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound. In this paper, we present several families of binary duadic codes of length $2^m-1$…