Related papers: Double Toeplitz codes and their average weight enu…
Subspace codes are collections of subspaces of a projective space such that any two subspaces satisfy a pairwise minimum distance criterion. Recent results have shown that it is possible to construct optimal $(5,3)$ subspace codes from…
We establish the existence of optimal maximal entanglement entanglement-assisted quantum $[[n,k,d;n-k]]_2$ codes for $(n,k,d)=(14,6,7)$, $(15,7,7)$, $(17,6,9)$, $(17,7,8)$, $(19,7,9)$ and $(20,7,10)$. These codes are obtained from…
In the present paper, we introduce the concepts of Jacobi polynomials and intersection enumerators of codes over $\mathbb{F}_q$ and $\mathbb{Z}_{k}$ for arbitrary genus $g$. We also discuss the interrelation among them. Finally, we give the…
The author has introduced in a recent paper a new class of operators, called co-Toeplitz operators, with symbols in a co-algebra. This is the categorical dual to Toeplitz operators which have symbols in an algebra. The mapping from a symbol…
The formal weight enumerators were first introduced by M. Ozeki. They form a ring of invariant polynomials which is similar to that of the weight enumerators of Type II codes. Later, the zeta functions for linear codes were discovered and…
In this paper we present several values for the next-to-minimal weights of projective Reed-Muller codes. We work over $\mathbb{F}_q$ with $q \geq 3$ since in IEEE-IT 62(11) p. 6300-6303 (2016) we have determined the complete values for the…
Linear codes have been an interesting subject of study for many years. Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, a class of three-weight linear codes over Fp…
Direct links between generalized harmonic numbers, linear Euler sums and Tornheim double series are established in a more perspicuous manner than is found in existing literature. We show that every linear Euler sum can be decomposed into a…
In the present paper, we give harmonic weight enumerators and Jacobi polynomials for the first-order Reed--Muller codes and the extended Hamming codes. As a corollary, we show the nonexistence of combinatorial $4$-designs in these codes.
This paper provides a systematic study of fundamental combinatorial properties of one-dimensional, two-sided infinite simple Toeplitz subshifts. Explicit formulas for the complexity function, the palindrome complexity function and the…
In this work, extension theorems are generalized to self-dual codes over rings and as applications many new binary self-dual extremal codes are found from self-dual codes over F_2^m+uF_2^m for m = 1, 2. The duality and distance preserving…
We present a family of reducible cyclic codes constructed as the direct sum of two different semiprimitive two-weight irreducible cyclic codes. This family generalizes the class of reducible cyclic codes that was reported in the main result…
Hermitian linear complementary dual codes are linear codes whose intersection with their Hermitian dual code is trivial. The largest minimum weight among quaternary Hermitian linear complementary dual codes of dimension $2$ is known 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…
Linear complementary dual (LCD) codes are linear codes that intersect with their dual codes trivially. We study the largest minimum weight $d_2(n,k)$ among all binary LCD $[n,k]$ codes and the largest minimum weight $d_3(n,k)$ among all…
We study the weighted compactness and boundedness of Toeplitz operators on the Fock spaces. Fix $\alpha>0$. Let $T_{\varphi}$ be the Toeplitz operator on the Fock space $F^2_{\alpha}$ over $\mathbb{C}^n$ with symbol $\varphi\in L^{\infty}$.…
Umbral extensions of the stirling numbers of the second kind are considered and the resulting dobinski-like various formulas including new ones are presented. These extensions naturally encompass the two well known q-extensions. The further…
Linear codes with few weights have applications in authentication codes, secrete sharing schemes, association schemes, consumer electronics and data storage system. In this paper, several classes of linear codes with two or three weights…
There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…
We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the chain ring $\mathbb{F}_p+u\mathbb{F}_p.$ They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss…