Related papers: On the weight distribution of linear sets with com…
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…
Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight…
Cone distribution functions from statistics are turned into Multi-Criteria Decision Making tools. It is demonstrated that this procedure can be considered as an upgrade of the weighted sum scalarization insofar as it absorbs a whole…
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,…
In this paper we develop in detail the geometric constructions that lead to many uniqueness results for the determination of polyhedral sets, typically scatterers, by a finite minimal number of measurements. We highlight how unique…
We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…
Fitting mixed models to complex survey data is a challenging problem. Most methods in the literature, including the most widely used one, require a close relationship between the model structure and the survey design. In this paper we…
This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…
A key to causal inference with observational data is achieving balance in predictive features associated with each treatment type. Recent literature has explored representation learning to achieve this goal. In this work, we discuss the…
We go through the many considerations involved in fitting a model to data, using as an example the fit of a straight line to a set of points in a two-dimensional plane. Standard weighted least-squares fitting is only appropriate when there…
Items from a database are often ranked based on a combination of multiple criteria. A user may have the flexibility to accept combinations that weigh these criteria differently, within limits. On the other hand, this choice of weights can…
We classify all finite linear spaces on at most 15 points admitting a blocking set. There are no such spaces on 11 or fewer points, one on 12 points, one on 13 points, two on 14 points, and five on 15 points. The proof makes extensive use…
In this paper, based on the theory of defining sets, two classes of at most six-weight linear codes over $\mathbb{F}_p$ are constructed. The weight distributions of the linear codes are determined by means of Gaussian period and Weil sums.…
We develop a statistical theory to characterize correlations in weighted networks. We define the appropriate metrics quantifying correlations and show that strictly uncorrelated weighted networks do not exist due to the presence of…
We give a broad survey of inequalities for the number of linear extensions of finite posets. We review many examples, discuss open problems, and present recent results on the subject. We emphasize the bounds, the equality conditions of the…
We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…
We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…
We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…
Saturating sets are combinatorial objects in projective spaces over finite fields that have been intensively investigated in the last three decades. They are related to the so-called covering problem of codes in the Hamming metric. In this…
Firstly, we give a formula on the generalized Hamming weight of linear codes constructed generically by defining sets. Secondly, by choosing properly the defining set we obtain a class of cyclotomic linear codes and then present two…