Related papers: When Variable-Length Codes Meet the Field of Error…
In this article, we consider the problem of testing the independence between two random variables. Our primary objective is to develop tests that are highly effective at detecting associations arising from explicit or implicit functional…
We present an asymptotic limit between correctable and uncor-rectable errors on the Reed-Muller codes of any order. This limit is theoretical and does not depend of any decoding algorithm.
Let $ (X,d) $ be a metric space. We study a metric $ d_0 $ on $ X $ naturally derived from $ d $. If $ (X,d) $ is complete and locally compact, or if it is complete and $ (d_0)_0=d_0 $, then $ d_0 $ coincides with the length metric induced…
We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult…
A $q$-analogue of the tau function of the modified KP hierarchy is defined by a change of independent variables. This tau function satisfies a system of bilinear $q$-difference equations. These bilinear equations are translated to the…
Constraint-based causal discovery algorithms utilize many statistical tests for conditional independence to uncover networks of causal dependencies. These approaches to causal discovery rely on an assumed correspondence between the…
For nonnegative integers $n_2, n_3$ and $d$, let $N(n_2,n_3,d)$ denote the maximum cardinality of a code of length $n_2+n_3$, with $n_2$ binary coordinates and $n_3$ ternary coordinates (in this order) and with minimum distance at least…
The problem of variable length and fixed-distortion universal source coding (or D-semifaithful source coding) for stationary and memoryless sources on countably infinite alphabets ($\infty$-alphabets) is addressed in this paper. The main…
It is proven that if $ (X,d) $ is an arbitrary metric space and $ U $ is a path-connected subset of $ X $ with $M:=\{x_i:\ i\in\{1,2,\dots,k\}\}\subset int(U) $, then the property of path-connectedness is also preserved in the resulting set…
Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this…
Testing for association or dependence between pairs of random variables is a fundamental problem in statistics. In some applications, data are subject to selection bias that causes dependence between observations even when it is absent from…
The bit-wise unequal error protection problem, for the case when the number of groups of bits $\ell$ is fixed, is considered for variable length block codes with feedback. An encoding scheme based on fixed length block codes with erasures…
Variable-to-variable length (VV) codes are a class of lossless source coding. As their name implies, VV codes encode a variable-length sequence of source symbols into a variable-length codeword. This paper will give a complete proof of an…
Given a Bayesian network structure (directed acyclic graph), the celebrated d-separation algorithm efficiently determines whether the network structure implies a given conditional independence relation. We show that this changes drastically…
We investigate the advantage of coherent superposition of two different coded channels in quantum metrology. In a continuous variable system, we show that the Heisenberg limit $1/N$ can be beaten by the coherent superposition without the…
A $q$-ary $t$-$(n,w,\lambda)$ design is a collection $\mathcal{A}$ of vectors of weight $w$ in $\mathbb{F}_{q}^{n}$ with the property that every vector of weight $t$ in $\mathbb{F}_{q}^{n}$ is contained in exactly $\lambda$ members of…
Rule based classifiers that use the presence and absence of key sub-strings to make classification decisions have a natural mechanism for quantifying the uncertainty of their precision. For a binary classifier, the key insight is to treat…
Underwater object-level mapping requires incorporating visual foundation models to handle the uncommon and often previously unseen object classes encountered in marine scenarios. In this work, a metric of semantic uncertainty for open-set…
Recently, it was discovered by several authors that a $q$-ary optimal locally recoverable code, i.e., a locally recoverable code archiving the Singleton-type bound, can have length much bigger than $q+1$. This is quite different from the…
One peculiarity with deletion-correcting codes is that perfect $t$-deletion-correcting codes of the same length over the same alphabet can have different numbers of codewords, because the balls of radius $t$ with respect to the…