相关论文: Weighted Coordinates Poset Block Codes

We consider the problem of finding a basis of a matroid with weight exactly equal to a given target. Here weights can be discrete values from $\{-\Delta,\ldots,\Delta\}$ or more generally $m$-dimensional vectors of such discrete values. We…

In this work, we present a deterministic algorithm for computing the entire weight distribution of polar codes. As the first step, we derive an efficient recursive procedure to compute the weight distribution that arises in successive…

In this note, we use the mass transference principle for rectangles, recently obtained by Wang and Wu (Math. Ann., 2021), to study the Hausdorff dimension of sets of "weighted $\Psi$-well-approximable" points in certain self-similar sets in…

Let $(X_1,d_1),\dots, (X_N,d_N)$ be metric spaces, where $d_i: X_i \times X_i \rightarrow [0,1]$ is a distance function for $i=1,\dots,N$. Let $\mathcal{X}$ denote the set theoretic product $X_1\times \cdots \times X_N$. Let $\mathcal{G} =…

We consider a problem in which a source is encoded into N packets, an unknown number of which are subject to adversarial errors en route to the decoder. We seek code designs for which the decoder is guaranteed to be able to reproduce the…

We study linear polynomial approximation of functions in weighted Sobolev spaces $W^r_{p,w}(\mathbb{R}^d)$ of mixed smoothness $r \in \mathbb{N}$, and their optimality in terms of Kolmogorov and linear $n$-widths of the unit ball…

Pomset block metric is a generalization of pomset metric. In this paper, we define weight enumerator of linear block codes in pomset metric over $\mathbb{Z}_m$ and establish MacWilliams type identities for linear block codes with respect to…

This paper presents the generalization of weighted distances to modules and their computation through the chamfer algorithm on general point lattices. The first part is dedicated to formalization of definitions and properties (distance,…

In this article, using variable matrix ${\mathscr{A}}_{p(\cdot),\infty}$ weights, we introduce the matrix-weighted variable Besov space $B^{s(\cdot)}_{p(\cdot),q(\cdot)}(W)$ and the corresponding averaging variable Besov space…

An integer composition of a nonnegative integer $n$ is a tuple $(\pi_1,\ldots,\pi_k)$ of nonnegative integers whose sum is $n$; the $\pi_i$'s are called the parts of the composition. For fixed number $k$ of parts, the number of $f$-weighted…

The aim of this survey is to outline the state of the art in research on a class of linearized polynomials with coefficients over finite fields, known as scattered polynomials. These have been studied in several contexts, such as in [A.…

In this paper, new few weights linear codes over the local ring $R=\mathbb{F}_p+u\mathbb{F}_p+v\mathbb{F}_p+uv\mathbb{F}_p,$ with $u^2=v^2=0, uv=vu,$ are constructed by using the trace function defined over an extension ring of degree $m.$…

Polarization-adjusted convolutional (PAC) codes combine the polar and convolutional transformations to enhance the distance properties of polar codes. They offer a performance very close to the finite length information-theoretic bounds for…

Label assignment (LA), which aims to assign each training sample a positive (pos) and a negative (neg) loss weight, plays an important role in object detection. Existing LA methods mostly focus on the design of pos weighting function, while…

In this letter, we introduce an efficient method for estimating weight distributions of polar codes and polarization-adjusted convolutional (PAC) codes. Based on a recursive algorithm of computing the weight enumerating functions of polar…

A new construction for constant weight codes is presented. The codes are constructed from $k$-dimensional subspaces of the vector space $\F_q^n$. These subspaces form a constant dimension code in the Grassmannian space $\cG_q(n,k)$. Some of…

Determining the weight distribution of a code is an old and fundamental topic in coding theory that has been thoroughly studied. In 1977, Helleseth, Kl{\o}ve, and Mykkeltveit presented a weight enumerator polynomial of the lifted code over…

Although numerous studies have focused on normal Besov spaces, limited studies have been conducted on exponentially weighted Besov spaces. Therefore, we define exponentially weighted Besov space $VB_{p,q}^{\delta,w}(\mathbb{R}^d)$ whose…

We study the approximation numbers of weighted composition operators $f\mapsto w\cdot(f\circ\varphi)$ on the Hardy space $H^2$ on the unit disc. For general classes of such operators, upper and lower bounds on their approximation numbers…

For nonnegative integers $n,d,w$, let $A(n,d,w)$ be the maximum size of a code $C \subseteq \mathbb{F}_2^n$ with constant weight $w$ and minimum distance at least $d$. We consider two semidefinite programs based on quadruples of code words…