相关论文: A further study on the mass formula for linear cod…
We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy…
Sum-rank metric codes, as a generalization of Hamming codes and rank metric codes, have important applications in fields such as multi-shot linear network coding, space-time coding and distributed storage systems. The purpose of this study…
Let $\Delta$ be a Delzant polytope in ${\mathbb R}^n$ and ${\mathbf b}\in{\mathbb Z}^n$. Let $E$ denote the symplectic fibration over $S^2$ determined by the pair $(\Delta,\,{\mathbf b})$. Under certain hypotheses, we prove the equivalence…
We test an algebraic algorithm based on the coordinate-space method, evaluating with high accuracy the critical mass for Wilson fermions in lattice QCD at two loops. We test the results by using different types of infrared regularization.
We investigate the asymptotic number of equivalence classes of linear codes with prescribed length and dimension. While the total number of inequivalent codes of a given length has been studied previously, the case where the dimension…
In this paper, we provide conditions that hulls of generalized Reed-Solomon (GRS) codes are also GRS codes from algebraic geometry codes. If the conditions are not satisfied, we provide a method of linear algebra to find the bases of hulls…
Quantum maximum-distance-separable (MDS) codes are an important class of quantum codes. In this paper, using constacyclic codes and Hermitain construction, we construct some new quantum MDS codes of the form $q=2am+t$,…
We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in (Kaibel and Pfetsch, 2008). These polytopes are the convex hulls of all 0/1-matrices with…
Sum-rank codes are an important class of codes which can be utilized for linear network coding, space-time coding and distributed storage. They can not only reduce the size of network alphabet but also detect and correct more errors. Based…
We introduce a general framework to deterministically construct binary measurement matrices for compressed sensing. The proposed matrices are composed of (circulant) permutation submatrix blocks and zero submatrix blocks, thus making their…
The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we…
Let L->M be a Hermitian line bundle over a compact manifold. Write S for the space of all unitary connections in L whose curvatures define symplectic forms on M and G for the group of unitary bundle isometries of L, which acts on S by…
List-decoding of Reed-Solomon (RS) codes beyond the so called Johnson radius has been one of the main open questions since the work of Guruswami and Sudan. It is now known by the work of Rudra and Wootters, using techniques from high…
Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivially. Multinegacirculant codes of index $2$ that are LCD are characterized algebraically and some good codes are found in this family. Exact…
Recent interest on permutation rank modulation shows the Kendall tau metric as an important distance metric. This note documents our first efforts to obtain upper bounds on optimal code sizes (for said metric) ala Delsarte's approach. For…
The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…
In this paper we study the algebraic geometry of any two-point code on the Hermitian curve and reveal the purely geometric nature of their dual minimum distance. We describe the minimum-weight codewords of many of their dual codes through…
The study of subblock-constrained codes has recently gained attention due to their application in diverse fields. We present bounds on the size and asymptotic rate for two classes of subblock-constrained codes. The first class is binary…
Sarvepalli and Klappenecker showed how classical one-point codes on the Hermitian curve can be used to construct quantum codes. Homma and Kim determined the parameters of a larger family of codes, the two-point codes. In quantum…
This work introduces a symplectic framework for quantum error correcting codes in which local structure is analyzed through an anticode perspective. In this setting, a code is treated as a symplectic space, and anticodes arise as maximal…