Related papers: Complete Weight Distribution and MacWilliams Ident…
We analyze the performance of quantum stabilizer codes, one of the most important classes for practical implementations, on both symmetric and asymmetric quantum channels. To this aim, we first derive the weight enumerator (WE) for the…
In this article, we illustrate an algorithm for the computation of the weight distribution of CRC codes. The recursive structure of CRC codes will give us an iterative way to compute the weight distribution of their dual codes starting from…
Given that approximate quantum error-correcting (AQEC) codes have a potentially better performance than perfect quantum error correction codes, it is pertinent to quantify their performance. While quantum weight enumerators establish some…
Linear codes can be employed to construct authentication codes, which is an interesting area of cryptography. The parameters of the authentication codes depend on the complete weight enumerator of the underlying linear codes. In order to…
The adjacency matrix associated with a convolutional code collects in a detailed manner information about the weight distribution of the code. A MacWilliams Identity Conjecture, stating that the adjacency matrix of a code fully determines…
In this paper, we have introduced the concepts of support distribution and the support enumerator as refinements of the classical weight distribution and weight enumerator respectively, capturing coordinate level activity in linear block…
This paper investigates the relationship between the rank weight distribution of a linear code and that of its dual code. The main result of this paper is that, similar to the MacWilliams identity for the Hamming metric, the rank weight…
Realizing the full potential of quantum computation requires Quantum Error Correction (QEC). QEC reduces error rates by encoding logical information across redundant physical qubits, enabling errors to be detected and corrected. A common…
A fundamental property of codes, the second-order weight distribution, is proposed to solve the problems such as computing second moments of weight distributions of linear code ensembles. A series of results, parallel to those for weight…
A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown to be a Fourier…
Self-dual binary linear codes have been extensively studied and classified for length n <= 40. However, little attention has been paid to linear codes that coincide with their orthogonal complement when the underlying inner product is not…
A hybrid code can simultaneously encode classical and quantum information into quantum digits such that the information is protected against errors when transmitted through a quantum channel. It is shown that a hybrid code has the…
We use derivatives to prove the equivalences between MacWilliams identity and its four equivalent forms, and present new interpretations for the four equivalent forms. Our results explicitly give out the relationships between MacWilliams…
Shearer and McEliece [1977] showed that there is no MacWilliams identity for the free distance spectra of orthogonal linear convolutional codes. We show that on the other hand there does exist a MacWilliams identity between the generating…
A pure multipartite quantum state is called absolutely maximally entangled (AME), if all reductions obtained by tracing out at least half of its parties are maximally mixed. Maximal entanglement is then present across every bipartition. The…
In this paper, we define dual codes over arbitrary finite rings with respect to arbitrary bilinear forms and provide a generalization of Hayden's theorem (Bridges, Hall, and Hayden, 1981). Building on this foundation, we introduce the…
The paper describes a method to determine symmetrized weight enumerators of $p^m$-linear codes based on the notion of a disjoint weight enumerator. Symmetrized weight enumerators are given for the lifted quadratic residue codes of length 24…
In this paper, we present the harmonic generalizations of well-known polynomials of codes over finite fields, namely the higher weight enumerators and the extended weight enumerators, and we derive the correspondences between these weight…
In this paper, based on the theory of defining sets, a class of four-weight or five-weight linear codes over Fp is constructed. The complete weight enumerators of the linear codes are determined by means of Weil sums. In some case, there is…
The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…