Related papers: Kasami type codes of higher relative dimension
We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…
In coding theory, a very interesting problem (but at the same time, a very difficult one) is to determine the weight distribution of a given code. This problem is even more interesting for cyclic codes, and this is so, mainly because they…
Let $q=2^n$ with $n=2m$ . Let $1\leq k\leq n-1$ and $k\neq m$. In this paper we determine the value distribution of following exponential sums \[\sum\limits_{x\in \bF_q}(-1)^{\Tra_1^m (\alpha x^{2^{m}+1})+\Tra_1^n(\beta…
Cyclic codes of dimension $2$ over a finite field are shown to have at most two nonzero weights. This extends a construction of Rao et al (2010) and disproves a conjecture of Schmidt-White (2002). We compute their weight distribution, and…
Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness properties of the associated $q$-system. Using this result, we…
The cyclic codes with parity check polynomial the reciprocal of the characteristic polynomial of the Fibonacci recurrence over a prime finite field are shown to have either one weight or two weights. When these codes are irreducible cyclic…
In this note we give the quasi-isometry classification for a class of right angled Artin groups. In particular, we obtain the first such classification for a class of Artin groups with dimension larger than 2; our families exist in every…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
Near maximum distance separable (NMDS) codes, where both the code and its dual are almost maximum distance separable, play pivotal roles in combinatorial design theory and cryptographic applications. Despite progress in fixed dimensions…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
We prove a highest weight theorem classifying irerducible finite--dimensional representations of quantum affine algebras and survey what is currently known about the structure of these representations.
We explicitly determine the values of reduced cyclotomic periods of order $2^m$, $m\ge 4$, for finite fields of characteristic $p\equiv 3$ or $5\pmod{8}$. These evaluations are applied to obtain explicit factorizations of the corresponding…
For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…
The weight distribution and weight hierarchy of a linear code are two important research topics in coding theory. In this paper, choosing $ D=\Big\{(x,y)\in \Big(\F_{p^{s_1}}\times\F_{p^{s_2}}\Big)\Big\backslash\{(0,0)\}:…
In this paper, we study dimensions of some varieties, that were introduced recently by Kisin in order to prove modularity of some Galois representations. In fact, we mainly consider a special case for which we obtain an estimation of the…
The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…
In this paper we determine the metric dimension of Andrasfai graphs and some related graphs.
In this paper, we construct the first families of asymmetric quantum convolutional codes (AQCC)'s. These new AQCC's are constructed by means of the CSS-type construction applied to suitable families of classical convolutional codes, which…
Lower bounds for the dimension of a triangulated category are provided. These bounds are applied to stable derived categories of Artin algebras and of commutative complete intersection local rings. As a consequence, one obtains bounds for…
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…