Related papers: Linearized Reed-Solomon codes and linearized Wenge…
In some applications of matching, the structural or hierarchical properties of the two graphs being aligned must be maintained. The hierarchical properties are induced by the direction of the edges in the two directed graphs. These…
In this note, we reveal a relation between the weight distribution of a concatenated code ensemble based on the Plotkin construction and those of its component codes. The relation may find applications in the calculation of the ensemble…
In this paper, we first give explicit formulas for the number of solutions of unweighted linear congruences with distinct coordinates. Our main tools are properties of Ramanujan sums and of the discrete Fourier transform of arithmetic…
In this work, doubly extended linearized Reed--Solomon codes and triply extended Reed--Solomon codes are generalized. We obtain a general result in which we characterize when a multiply extended code for a general metric attains the…
For Paley-Wiener functions on weighted combinatorial finite or infinite graphs we develop a weighted sampling theory in which samples are defined as inner products with weight functions (measuring devices). Three reconstruction methods are…
We prove an extension of the Regularity Lemma with vertex and edge weights which can be applied for a large class of graphs. The applications involve random graphs and a weighted version of the Erd\H{o}s-Stone theorem. We also provide means…
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…
A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…
In this paper, for an odd prime $p$, several classes of two-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from the defining sets, and then their complete weight distributions are determined by employing character…
We study the behavior of weighted residual polynomials on circular arcs, including weighted Chebyshev polynomials. For weights given by reciprocals of polynomials, we establish Szeg\H{o}-Widom asymptotics. Extending our analysis to less…
We show that the adjacency matrices of the intersection graphs of chord diagrams satisfy the 2-term relations of Bar-Natan and Garoufalides [bg], and hence give rise to weight systems. Among these weight systems are those associated with…
We propose a random bipartite graph with weights assigned to both parts of the vertex sets. Edges are formed independently with probabilities that depend on these weights. This bipartite graph naturally gives rise to a random intersection…
Latroids were introduced by Vertigan, who associated a latroid to a linear block code and showed that its Tutte polynomial determines the weight enumerator of the code. We associate a latroid to a code over a ring or a field endowed with a…
Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…
Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…
Linear codes with few weights have many applications in secret sharing schemes, authentication codes, communication and strongly regular graphs. In this paper, we consider linear codes with three weights in arbitrary characteristic. To do…
In the present work, new classes of wavelet functions are presented in the framework of Clifford analysis. Firstly, some classes of new monogenic polynomials are provided based on 2-parameters weight functions. Such classes extend the well…
It is known that many networks modeling real-life complex systems are small-word (large local clustering and small diameter) and scale-free (power law of the degree distribution), and very often they are also hierarchical. Although most of…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
Linear codes have diverse applications in secret sharing schemes, secure two-party computation, association schemes, strongly regular graphs, authentication codes and communication. There are a large number of linear codes with few weights…