Related papers: Double Toeplitz codes and their average weight enu…
In a recent paper ([quant-ph/9610040]), Shor and Laflamme define two ``weight enumerators'' for quantum error correcting codes, connected by a MacWilliams transform, and use them to give a linear-programming bound for quantum codes. We…
A closed form formula of the partition weight enumerator of maximum distance separable (MDS) codes is derived for an arbitrary number of partitions. Using this result, some properties of MDS codes are discussed. The results are extended for…
We will show that the sequence appearing in the double recurrence theorem is a good universal weight for the Furstenberg averages. That is, given a system $(X, \mathcal{F}, \mu, T)$ and bounded functions $f_1, f_2 \in L^\infty(\mu)$, there…
We reconsider studies of Toeplitz operators on function spaces (the weighted Bergman space, the generalized derivative Hardy space) and the H-Toeplitz operators on the Bergman space. Past studies have considered the presence or absence of…
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we solve one more special case. The problem of finding the weight distribution is transformed into a…
Upper and lower bounds on the largest number of weights in a cyclic code of given length, dimension and alphabet are given. An application to irreducible cyclic codes is considered. Sharper upper bounds are given for the special cyclic…
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…
In this paper we present a fast and efficient method to find partial weight enumerator (PWE) for binary linear block codes by using the error impulse technique and Monte Carlo method. This PWE can be used to compute an upper bound of the…
This paper investigates the essential norm of Toeplitz operators $\mathcal{T}_\mu$ acting from the Bergman space $A_\omega^p$ to $A_\omega^q$ ($1 < p \leq q < \infty$) on the unit ball, where $\mu$ is a positive Borel measure and $\omega…
The serial concatenation of a repetition code with two or more accumulators has the advantage of a simple encoder structure. Furthermore, the resulting ensemble is asymptotically good and exhibits minimum distance growing linearly with…
We consider L^p two weight inequalities for maximal truncations of dyadic Calderon-Zygmund operators. In the case of one weight being doubling, a characterization is given, and for the general case, sufficient conditions are given,…
Multipliers between kernels of Toeplitz operators are characterised in terms of test functions (so-called maximal vectors for the kernels); these maximal vectors may easily be parametrised in terms of inner and outer factorizations.…
The aim of this paper is to investigate asymmetric truncated Toeplitz operators with $L^2$ symbols between two different model spaces given by inner functions such that one divides the other. Characterizations of these operators are given…
The average weight distribution of a regular low-density parity-check (LDPC) code ensemble over a finite field is thoroughly analyzed. In particular, a precise asymptotic approximation of the average weight distribution is derived for the…
Linear codes with a few weights have wide applications in information security, data storage systems, consuming electronics and communication systems. Construction of the linear codes with a few weights and determination of their parameters…
Boolean functions have very nice applications in cryptography and coding theory, which have led to a lot of research focusing on their applications. The objective of this paper is to construct binary linear codes with few weights from the…
Double circulant codes of length $2n$ over the semilocal ring $R = \mathbb{F}_q + u\mathbb{F}_q,\, u^2=u,$ are studied when $q$ is an odd prime power, and $-1$ is a square in $\mathbb{F}_q.$ Double negacirculant codes of length $2n$ are…
In this paper, we give a new upper bound on the minimum Euclidean weight of Type II $\ZZ_{2k}$-codes and the concept of extremality for the Euclidean weights when $k=3,4,5,6$. Together with the known result, we demonstrate that there is an…
In this paper, we derive the average weight distributions for the irregular non-binary cluster low-density parity-check (LDPC) code ensembles. Moreover, we give the exponential growth rate of the average weight distribution in the limit of…
In this paper, we consider codes over finite fields, finite abelian groups, and finite Frobenius rings. For such codes, the complete weight enumerator and the Hamming weight enumerator serve as powerful tools. These two types of weight…