English
Related papers

Related papers: Weighted Coordinates Poset Block Codes

200 papers

Relations between the local weight distributions of a binary linear code, its extended code, and its even weight subcode are presented. In particular, for a code of which the extended code is transitive invariant and contains only codewords…

Information Theory · Computer Science 2016-11-17 Kenji Yasunaga , Toru Fujiwara

In Pattern Matching with Weighted Edits (PMWED), we are given a pattern $P$ of length $m$, a text $T$ of length $n$, a positive threshold $k$, and oracle access to a weight function that specifies the costs of edits (depending on the…

Data Structures and Algorithms · Computer Science 2025-10-21 Panagiotis Charalampopoulos , Tomasz Kociumaka , Philip Wellnitz

The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and…

Information Theory · Computer Science 2008-07-18 Yeow Meng Chee , Gennian Ge , Alan C. H. Ling

We present a method of finding weighted Koppelman formulas for $(p,q)$-forms on $n$-dimensional complex manifolds $X$ which admit a vector bundle of rank $n$ over $X \times X$, such that the diagonal of $X \times X$ has a defining section.…

Complex Variables · Mathematics 2008-06-10 Elin Götmark

We study the problem of estimating the sum of $n$ elements, each with weight $w(i)$, in a structured universe. Our goal is to estimate $W = \sum_{i=1}^n w(i)$ within a $(1 \pm \epsilon)$ factor using a sublinear number of samples, assuming…

Data Structures and Algorithms · Computer Science 2025-04-22 Pinki Pradhan , Sampriti Roy

The $p$-ary code associated with the incidence structure of points and $t$-spaces in a projective space $\mathrm{PG}(m,q)$, where $q=p^h$, is the $\mathbb{F}_p$-subspace generated by the incidence vectors of the blocks of this design. The…

Combinatorics · Mathematics 2025-10-07 Bence Csajbók , Giovanni Longobardi , Giuseppe Marino , Rocco Trombetti

Let $M_w = (\Pj^1)^n \q \mathrm{SL}_2$ denote the geometric invariant theory quotient of $(\Pj^1)^n$ by the diagonal action of $\mathrm{SL}_2$ using the line bundle $\mathcal{O}(w_1,w_2,...,w_n)$ on $(\Pj^1)^n$. Let $R_w$ be the coordinate…

Algebraic Geometry · Mathematics 2014-01-21 Milena Hering , Benjamin Howard

The $(P, \omega)$-partition generating function of a labeled poset $(P, \omega)$ is a quasisymmetric function enumerating certain order-preserving maps from $P$ to $\mathbb{Z}^+$. We study the expansion of this generating function in the…

Combinatorics · Mathematics 2019-12-24 Ricky Ini Liu , Michael Weselcouch

Let $w=(w_1,\dots,w_d)$ be a $d$-tuple of positive real numbers such that $\sum_{i}w_i =1$ and $w_1\geq \cdots \geq w_d$. A $d$-dimensional vector $x=(x_1,\dots,x_d)\in\mathbb{R}^d$ is said to be $w$-singular if for every $\epsilon>0$ there…

Number Theory · Mathematics 2024-04-10 Taehyeong Kim , Jaemin Park

Letting $P$ be a convex polytope in $\mathbb{R}^d$ with $n>d$ vertices, we study geometric and analytical properties of the set of generalized barycentric coordinates relative to any point $p\in P$. We prove that such sets are polytopes in…

Metric Geometry · Mathematics 2024-03-01 Fabio V. Difonzo

This memoir constitutes the author's PhD thesis at Cornell University. It serves both as an expository work and as a description of new research. At the heart of the memoir, we introduce and study a poset $NC^{(k)}(W)$ for each finite…

Combinatorics · Mathematics 2007-10-19 Drew Armstrong

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of $t$-weight linear codes over ${\mathbb F}_{q}$ are presented with…

Information Theory · Computer Science 2025-01-22 Zhao Hu , Mingxiu Qiu , Nian Li , Xiaohu Tang , Liwei Wu

In this paper, we investigate completely decomposable rank-metric codes, i.e. rank-metric codes that are the direct sum of 1-dimensional maximum rank distance codes. We study the weight distribution of such codes, characterizing codewords…

Information Theory · Computer Science 2024-06-28 Paolo Santonastaso

The class of poset metrics is very large and contains some interesting families of metrics. A family of metrics, based on posets which are formed from disjoint chains which have the same size, is examined. A necessary and sufficient…

Information Theory · Computer Science 2015-03-19 Tuvi Etzion

In this paper, we introduce the concept of mixed (G, S)-monotone mappings and prove coupled coincidence and coupled common fixed point theorems for such mappings satisfying a nonlinear contraction involving altering distance functions.…

General Topology · Mathematics 2011-05-17 Habib Yazidi

In this paper, we characterize bounded, compact and order bounded sum of weighted differentiation composition operators from Bergman type spaces to weighted Banach spaces of analytic functions, where the sum of weighted differentiation…

Functional Analysis · Mathematics 2022-11-17 Aakriti Sharma

We use the polynomial partitioning method of Guth to prove weighted Fourier restriction estimates in $\Bbb R^3$ with exponents $p$ that range between $3$ and $3.25$, depending on the weight. As a corollary to our main theorem, we obtain new…

Classical Analysis and ODEs · Mathematics 2017-06-07 Bassam Shayya

Linear sets on the projective line have attracted a lot of attention because of their link with blocking sets, KM-arcs and rank-metric codes. In this paper, we study linear sets having two points of complementary weight, that is with two…

Combinatorics · Mathematics 2021-07-23 Vito Napolitano , Olga Polverino , Paolo Santonastaso , Ferdinando Zullo

Extending results of Linial (1984) and Aigner (1985), we prove a uniform lower bound on the balance constant of a poset $P$ of width $2$. This constant is defined as $\delta(P) = \max_{(x, y)\in P^2}\min\{\mathbb{P}(x\prec y),…

Combinatorics · Mathematics 2021-06-21 Ashwin Sah

Few-weight codes have been constructed and studied for many years, since their fascinating relations to finite geometries, strongly regular graphs and Boolean functions. Simplex codes are one-weight Griesmer $[\frac{q^k-1}{q-1},k…

Information Theory · Computer Science 2024-08-20 Xu Pan , Hao Chen , Hongwei Liu , Shengwei Liu