Related papers: Kasami type codes of higher relative dimension
We present a new notion, the upper Aikawa codimension, and establish its equivalence with the upper Assouad codimension in a metric space with a doubling measure. To achieve this result, we first prove variant of a local fractional Hardy…
Recently, linear codes constructed by defining sets have attracted a lot of study, and many optimal linear codes with a few weights have been produced. The objective of this paper is to present a class of binary linear codes with three…
In this paper, we investigate completely decomposable rank-metric codes, i.e. rank-metric codes that are the direct sum of 1-dimensional maximum rank distance codes. We study the weight distribution of such codes, characterizing codewords…
We present the eigenvalues of the Casimir invariants for the type I quantum superalgebras on any irreducible highest weight module.
Castello $\textit{et al}$. [J. Comb. Theory Ser. A, 212, 106005 (2025)] provided a complete classification for full weight spectrum (FWS) one-orbit cyclic subspace codes. In this paper, we determine the weight distributions of a family of…
We examine $q-$series related to higher forms. These forms are cubics, quartics, etc. In some points, in the article we add parts from previous works, in such a way, the article be more complete and readable.
The multi-edge type LDPC codes, introduced by Richardson and Urbanke, present the general class of structured LDPC codes. In this paper, we derive the average weight distributions of the multi-edge type LDPC code ensembles. Furthermore, we…
Recently, Komatsu introduced the concept of poly-Cauchy numbers and polynomials which generalize Cauchy numbers and polynomials. In this paper, we consider the new concept of higher-order Cauchy numbers and polynomials which generalize…
Cyclic codes have been widely used in digital communication systems and consume electronics as they have efficient encoding and decoding algorithms. The weight distribution of cyclic codes has been an important topic of study for many…
A new construction of codes from old ones is considered, it is an extension of the matrix-product construction. Several linear codes that improve the parameters of the known ones are presented.
We obtain some new inequalities of Chebyshev Type.
In this paper non-trivial non-linear binary systematic AMDS codes are classified in terms of their weight distributions, employing only elementary techniques. In particular, we show that their length and minimum distance completely…
Multidimensional convolutional codes generalize (one dimensional) convolutional codes and they correspond under a natural duality to multidimensional systems widely studied in the systems literature.
Coset constructions of $q$-ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the system can obtain information while still allowing for local…
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…
In this paper, for any odd prime $p$ and an integer $m\ge 3$, several classes of linear codes with $t$-weight $(t=3,5,7)$ are obtained based on some defining sets, and then their complete weight enumerators are determined explicitly by…
We give a recursive construction for projective Reed-Muller codes in terms of affine Reed-Muller codes and projective Reed-Muller codes in fewer variables. From this construction, we obtain the dimension of the subfield subcodes of…
Recently, there has been intensive research on the weight distributions of cyclic codes. In this paper, we compute the weight distributions of three classes of cyclic codes with Niho exponents. More specifically, we obtain two classes of…
We compute many dimensions of spaces of finite type invariants of virtual knots (of several kinds) and the dimensions of the corresponding spaces of "weight systems", finding everything to be in agreement with the conjecture that "every…
We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.