相关论文: Weights which respect support and NN-decoding

Distance metric learning aims to learn from the given training data a valid distance metric, with which the similarity between data samples can be more effectively evaluated for classification. Metric learning is often formulated as a…

The number-theoretic codes are a class of codes defined by single or multiple congruences. These codes are mainly used for correcting insertion and deletion errors, and for correcting asymmetric errors. This paper presents a formula for a…

The MacWilliams extension theorem is investigated for various weight functions over finite Frobenius rings. The problem is reformulated in terms of a local-global property for subgroups of the general linear group. Among other things, it is…

We show that the bipartite separability of a pure qubit state hinges critically on the combinatorial structure of its computational-basis support. Using Boolean cube geometry, we introduce a taxonomy that distinguishes support-guaranteed…

A novel mathematical framework is derived for the addition of nodes to univariate and interpolatory quadrature rules. The framework is based on the geometrical interpretation of the Vandermonde matrix describing the relation between the…

We give a general description of the construction of weighted spherically symmetric metrics on vector bundle manifolds, i.e. the total space of a vector bundle $E\rightarrow M$, over a Riemannian manifold $M$, when $E$ is endowed with a…

Modeling of high-dimensional data is very important to categorize different classes. We develop a new mixture model called Multinomial cluster-weighted model (MCWM). We derive the identifiability of a general class of MCWM. We estimate the…

In this paper we present a new method for finding the weight enumerator of binary linear block codes by using genetic algorithms. This method consists in finding the binary weight enumerator of the code and its dual and to create from the…

We describe the notion of a \emph{weighting} along a submanifold $N\subset M$, and explore its differential-geometric implications. This includes a detailed discussion of weighted normal bundles, weighted deformation spaces, and weighted…

In this paper we investigate connections between linear sets and subspaces of linear maps. We give a geometric interpretation of the results of [18, Section 5] on linear sets on a projective line. We extend this to linear sets in arbitrary…

The present work proposes and discusses the category of supported sets which provides a uniform foundation for nominal sets of various kinds, such as those for equality symmetry, for the order symmetry, and renaming sets. We show that all…

We propose a new method for defining a notion of support for objects in any compactly generated triangulated category admitting small coproducts. This approach is based on a construction of local cohomology functors on triangulated…

We investigate the signed support, that is, the set of the exponent vectors and the signs of the coefficients, of a multivariate polynomial $f$. We describe conditions on the signed support ensuring that the semi-algebraic set, denoted as…

This paper introduces $\infty$- and $n$-fold vector bundles as special functors from the $\infty$- and $n$-cube categories to the category of smooth manifolds. We study the cores and "n-pullbacks" of $n$-fold vector bundles and we prove…

In this paper we introduce and investigate rank-metric intersecting codes, a new class of linear codes in the rank-metric context, inspired by the well-studied notion of intersecting codes in the Hamming metric. A rank-metric code is said…

Let $P = (\{1,2,\ldots,n,\leq)$ be a poset that is an union of disjoint chains of the same length and $V=\mathbb{F}_q^N$ be the space of $N$-tuples over the finite field $\mathbb{F}_q$. Let $V_i = \mathbb{F}_q^{k_i}$, $1 \leq i \leq n$, be…

The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…

We study the joint distribution of the input sum and the output sum of a deterministic transducer. Here, the input of this finite-state machine is a uniformly distributed random sequence. We give a simple combinatorial characterization of…

One-weight codes, in which all nonzero codewords share the same weight, form a highly structured class of linear codes with deep connections to finite geometry. While their classification is well understood in the Hamming and rank metrics -…

We provide an algebraic description for sum-rank metric codes, as quotient space of a skew polynomial ring. This approach generalizes at the same time the skew group algebra setting for rank-metric codes and the polynomial setting for codes…