Related papers: When Variable-Length Codes Meet the Field of Error…
We consider extensions of quasiconformal maps and the uniformization theorem to the setting of metric spaces $X$ homeomorphic to $\mathbb R^2$. Given a measure $\mu$ on such a space, we introduce $\mu$-quasiconformal maps $f:X \to \mathbb…
Distance-based unsupervised text classification is a method within text classification that leverages the semantic similarity between a label and a text to determine label relevance. This method provides numerous benefits, including fast…
The breakthrough of quantum error correction brought with it the picture of quantum information as a sort of combination of two complementary types of classical information, "amplitude" and "phase". Here I show how this intuition can be…
Recent interest on permutation rank modulation shows the Kendall tau metric as an important distance metric. This note documents our first efforts to obtain upper bounds on optimal code sizes (for said metric) ala Delsarte's approach. For…
Let $q$ be an odd prime power and let $X(m,q)$ be the set of symmetric bilinear forms on an $m$-dimensional vector space over $\mathbb{F}_q$. The partition of $X(m,q)$ induced by the action of the general linear group gives rise to a…
We show that with high probability, random rank 1 matrices over a finite field are in (linearly) general position, at least provided their shape k x l is not excessively unbalanced. This translates into saying that the dimension of the…
We study error-correcting codes in the space $\mathcal{S}_{n,q}$ of length-$n$ multisets over a $q$-ary alphabet, motivated by permutation channels in which ordering is completely lost and errors act solely by deletions of symbols, i.e., by…
A pair of variables that tend to rise and fall either together or in opposition are said to be monotonically associated. For certain phenomena, this tendency is causally restricted to a subpopulation, as, for example, an allergic reaction…
The type $\tau$($\alpha$) of an irrational number $\alpha$ measures the extent to which rational numbers can closely approximate $\alpha$. More precisely, $\tau$($\alpha$) is the infimum over those t$\in$R for which…
Quantum mechanics predicts that measurements of incompatible observables carry a minimum uncertainty which is independent of technical deficiencies of the measurement apparatus or incomplete knowledge of the state of the system. Nothing yet…
A locally testable language L is a language with the property that for some non negative integer k, called the order or the level of local testable, whether or not a word u in the language L depends on (1) the prefix and the suffix of the…
The Hales-Jewett Theorem states that given any finite nonempty set $\A$ and any finite coloring of the free semigroup $S$ over the alphabet $\A$ there is a {\it variable word\/} over $\A$ all of whose instances are the same color. This…
Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank…
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain…
A temporal (directed) graph is a graph whose edges are available only at specific times during its lifetime, $\tau$. Paths are sequences of adjacent edges whose appearing times are either strictly increasing or non-strictly increasingly…
We consider $t$-Lee-error-correcting codes of length $n$ over the residue ring $\mathbb{Z}_m := \mathbb{Z}/m\mathbb{Z}$ and determine upper and lower bounds on the number of $t$-Lee-error-correcting codes. We use two different methods,…
The simplest condition characterizing quasi-finite CW complexes $K$ is the implication $X\tau_h K\implies \beta(X)\tau K$ for all paracompact spaces $X$. Here are the main results of the paper: Theorem: If $\{K_s\}_{s\in S}$ is a family of…
We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…
If A is a finite alphabet, Z^D is a D-dimensional lattice, U is a subset of Z^D, and mu_U is a probability measure on A^U that ``looks like'' the marginal projection of a stationary random field on A^(Z^D), then can we ``extend'' mu_U to…
The problem of error control in random linear network coding is addressed from a matrix perspective that is closely related to the subspace perspective of K\"otter and Kschischang. A large class of constant-dimension subspace codes is…