Related papers: Groups of linear isometries on weighted poset bloc…
A broad class of informationally complete symmetric measurements is introduced. It can be understood as a common generalization of symmetric, informationally complete POVMs and mutually unbiased bases. Additionally, it provides a natural…
Minimal codes are a class of linear codes which gained interest in the last years, thanks to their connections to secret sharing schemes. In this paper we provide the weight distribution and the parameters of families of minimal codes…
Poset metrics in the context of stabilizer codes are investigated. MDS stabilizer poset codes are defined. Various characterizations of these quantum codes are found. Methods for producing examples are proposed.
Generalized pair weights of linear codes are generalizations of minimum symbol-pair weights, which were introduced by Liu and Pan \cite{LP} recently. Generalized pair weights can be used to characterize the ability of protecting information…
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.…
We propose a new class of metrics on sets, vectors, and functions that can be used in various stages of data mining, including exploratory data analysis, learning, and result interpretation. These new distance functions unify and generalize…
Cyclic subspace codes gained a lot of attention especially because they may be used in random network coding for correction of errors and erasures. Roth, Raviv and Tamo in 2018 established a connection between cyclic subspace codes (with…
In this paper, we introduce code distances, a new family of invariants for linear codes. We establish some properties and prove bounds on the code distances, and show that they are not invariants of the matroid (for a linear block code) or…
Given metric spaces $(X,d)$ and $(Y,\rho)$ and an ordering $x_1,x_2,\ldots,x_n$ of $(X,d)$, an embedding $f: X \rightarrow Y$ is said to have a prioritized distortion $\alpha(\cdot)$, if for any pair $x_j,x'$ of distinct points in $X$, the…
We consider linear codes over a field in which the error values are restricted to a subgroup of its unit group. This scenario captures Lee distance codes as well as codes over the Gaussian or Eisenstein integers. Codes correcting restricted…
Error-correcting pairs were introduced in 1988 by R. Pellikaan, and were found independently by R. K\"otter (1992), as a general algebraic method of decoding linear codes. These pairs exist for several classes of codes. However little or no…
In an undirected graph $G=(V,E)$, we say $(A,B)$ is a pair of perfectly matched sets if $A$ and $B$ are disjoint subsets of $V$ and every vertex in $A$ (resp. $B$) has exactly one neighbor in $B$ (resp. $A$). The size of a pair of perfectly…
We show that countable metric spaces always have quantum isometry groups, thus extending the class of metric spaces known to possess such universal quantum-group actions. Motivated by this existence problem we define and study the notion of…
Universal security over a network with linear network coding has been intensively studied. However, previous linear codes and code pairs used for this purpose were linear over a larger field than that used on the network, which restricts…
In \cite{PSMA}, Pal et al. introduced some weighted means and gave some related inequalities by using an approach for operator monotone functions. This paper discusses the construction of these weighted means in a simple and nice setting…
Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in the multishot network coding, the space-time coding and the distributed storage. In this paper, by constructing covering codes…
S-embeddings were introduced by Chelkak as a tool to study the conformal invariance of the thermodynamic limit of the Ising model. Moreover, Chelkak, Laslier and Russkikh introduced a lift of s-embeddings to Lorentz space, and showed that…
We extend the definitions of complexity measures of functions to domains such as the symmetric group. The complexity measures we consider include degree, approximate degree, decision tree complexity, sensitivity, block sensitivity, and a…
Symbol-pair codes are block codes with symbol-pair metrics designed to protect against pair-errors that may occur in high-density data storage systems. MDS symbol-pair codes are optimal in the sense that it can attain the highest pair-error…
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…