相关论文: Perfect Mannheim, Lipschitz and Hurwitz weight cod…
This paper studies the cardinality of codes correcting insertions and deletions. We give improved upper and lower bounds on code size. Our upper bound is obtained by utilizing the asymmetric property of list decoding for insertions and…
In this paper, we present the harmonic generalizations of well-known polynomials of codes over finite fields, namely the higher weight enumerators and the extended weight enumerators, and we derive the correspondences between these weight…
In this paper, for an odd prime power $q$, we extend the construction of Xie et al. \cite{XOYM2023} to propose two classes of linear codes $\mathcal{C}_{Q}$ and $\mathcal{C}_{Q}'$ over the finite field $\mathbb{F}_{q}$ with at most four…
We obtain an optimal deviation from the mean upper bound \begin{equation} D(x)\=\sup_{f\in \F}\mu\{f-\E_{\mu} f\geq x\},\qquad\ \text{for}\ x\in\R\label{abstr} \end{equation} where $\F$ is the class of the integrable, Lipschitz functions on…
Let $k$ be an even positive integer, $p$ be a prime and $m$ be a nonnegative integer. We find an upper bound for orders of zeros (at cusps) of a linear combination of classical Eisenstein series of weight $k$ and level $p^m$. As an…
In 1997 Rosenthal and York defined generalized Hamming weights for convolutional codes, by regarding a convolutional code as an infinite dimensional linear code endowed with the Hamming metric. In this paper, we propose a new definition of…
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…
This correspondence introduces two new constructive techniques to complete the determination of the sizes of optimal q-ary codes of constant weight three and distance four.
The study of the generalized Hamming weight of linear codes is a significant research topic in coding theory as it conveys the structural information of the codes and determines their performance in various applications. However,…
We introduce a new weight and corresponding metric over finite extension fields for asymmetric error correction. The weight distinguishes between elements from the base field and the ones outside of it, which is motivated by asymmetric…
We provide an effective upper bound for positive integers with bounded Hamming weights with respect to both a linear recurrence numeration system and an Ostrowski-$\alpha$ numeration system, where $\alpha$ is a quadratic irrational. We…
The Hurwitz complex continued fraction is a generalization of the nearest integer continued fraction. In this paper we prove various results concerning extremes of the modulus of Hurwitz complex continued fraction digits. This includes a…
In this paper, we consider codes over finite fields, finite abelian groups, and finite Frobenius rings. For such codes, the complete weight enumerator and the Hamming weight enumerator serve as powerful tools. These two types of weight…
We obtain new characterizations for Bergman spaces with standard weights in terms of Lipschitz type conditions in the Euclidean, hyperbolic, and pseudo-hyperbolic metrics. As a consequence, we prove optimal embedding theorems when an…
We provide a upper bound for Triebel-Lizorkin capacity in metric settings in terms of Hausdorff measure. On the other hand, we also prove that the sets with zero capacity have generalized Hausdorff $h$-measure zero for a suitable gauge…
As the real counterpart of double Hurwitz number, the real double Hurwitz number depends on the distribution of real branch points. We consider the problem of asymptotic growth of real and complex double Hurwitz numbers. We provide a lower…
In 2016, the Hurwitz metric was introduced by D. Minda in arbitrary proper subdomains of the complex plane and he proved that this metric coincides with the Poincar\'e's hyperbolic metric when the domains are simply connected. In this…
This paper introduces a measure, called Lipschitz widths, of the optimal performance possible of certain nonlinear methods of approximation. It discusses their relation to entropy numbers and other well known widths such as the Kolmogorov…
We analyze stability of conservative solutions of the Cauchy problem on the line for the (integrated) Hunter-Saxton (HS) equation. Generically, the solutions of the HS equation develop singularities with steep gradients while preserving…
We solve Lehmer's problem for a class of polynomials arising from Hermitian matrices over the Eisenstein and Gaussian integers, that is, we show that all such polynomials have Mahler measure at least Lehmer's number \tau_0 = 1.17628... .