相关论文: Weights which respect support and NN-decoding
We introduce the notion of a weighted $\delta$-vector of a lattice polytope. Although the definition is motivated by motivic integration, we study weighted $\delta$-vectors from a combinatorial perspective. We present a version of Ehrhart…
We investigate local and global weighted heights a-la Weil for weighted projective spaces via Cartier and Weil divisors and extend the definition of weighted heights on weighted projective spaces from arXiv:1902.06563 to weighted varieties…
Assessing the statistical significance of network patterns is crucial for understanding whether such patterns indicate the presence of interesting network phenomena, or whether they simply result from less interesting processes, such as…
We introduce a new method to study mixed characteristic deformation of line bundles. In particular, for sufficiently large smooth projective families $f : \mathscr{X} \to \mathscr{S}$ defined over the ring of $N$-integers…
We consider orthogonal polynomials with respect to the weight $|z^2+a^2|^{cN}e^{-N|z|^2}$ in the whole complex plane. We obtain strong asymptotics and the limiting normalized zero counting measure (mother body) of the orthogonal polynomials…
We derive a general lower bound for the generalized Hamming weights of nested matrix-product codes, with a particular emphasis on the cases with two and three constituent codes. We also provide an upper bound which is reminiscent of the…
We give sufficient conditions which ensure that a functor of finite length from an additive category to finite-dimensional vector spaces has a projective resolution whose terms are finitely generated. For polynomial functors, we study also…
Linear sets over finite fields are central objects in finite geometry and coding theory, with deep connections to structures such as semifields, blocking sets, KM-arcs, and rank-metric codes. Among them, $i$-clubs, a class of linear sets…
We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…
In this paper we extend the concept of generalized Wei weights for poset-weight codes and show that all linear codes C satisfy the chain condition if support of C is a subposet totally ordered.
Due to \v{C}encov's theorem, there exists a unique family of invariant symmetric $(0,2)$-tensor fields on the space of positive probability measures on a set of $n$-points indexed by $n\in \mathbb{N}$ under Markov embeddings. We deform…
Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness properties of the associated $q$-system. Using this result, we…
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…
We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…
For any essentially small triangulated category the centre of its lattice of thick subcategories is introduced; it is a spatial frame and yields a notion of central support. A relative version of this centre recovers the support theory for…
Support points summarize a large dataset through a smaller set of representative points that can be used for data operations, such as Monte Carlo integration, without requiring access to the full dataset. In this sense, support points offer…
We study certain pairs of subspaces $V$ and $W$ of $\mathbb{C}^n$ we call supports that consist of eigenspaces of the eigenvalues $\pm\|M\|$ of a minimal hermitian matrix $M$ ($\|M\|\leq \|M+D\|$ for all real diagonals $D$). For any pair of…
In this paper we look at isometry properties of random matrices. During the last decade these properties gained a lot attention in a field called compressed sensing in first place due to their initial use in \cite{CRT,CT}. Namely, in…
Linear programming approaches have been applied to derive upper bounds on the size of classical codes and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance, including nonadditive…
This paper examines the $w$-weight enumerators of weights $w$ with maximal symmetry over finite chain rings and matrix rings over finite fields. In many cases, including the homogeneous weight, the MacWilliams identities for $w$-weight…