Related papers: Angle Between Two Vectors over Finite Fields and a…

We investigate adaptive single-trial error/erasure decoding of binary codes whose decoder is able to correct e errors and t erasures if le+t<=d-1. Thereby, d is the minimum Hamming distance of the code and 1<l<=2 is the tradeoff parameter…

In this paper, we study the Hamming distance between vectorial Boolean functions and affine functions. This parameter is known to be related to the non-linearity and differential uniformity of vectorial functions, while the calculation of…

Let ${\cal C}({\cal H})={\cal B}({\cal H}) / {\cal K}({\cal H})$ be the Calkin algebra (${\cal B}({\cal H})$ the algebra of bounded operators on the Hilbert space ${\cal H}$, ${\cal K}({\cal H})$ the ideal of compact operators and…

One open problem in source coding is to characterize the limits of representing losslessly a non-identity discrete function of the data encoded independently by the encoders of several correlated sources with memory. This paper investigates…

We consider the problem of describing the typical (possibly) non-linear code of minimum distance bounded from below over a large alphabet. We concentrate on block codes with the Hamming metric and on subspace codes with the injection…

We study optimization problems on Hadamard manifolds, motivated by recent advances in geometric approaches to optimization on curved spaces, particularly those involving the structure of Busemann functions. We introduce a projection based…

Let $G$ be a finite connected simple graph with a chosen orientation of its edges. For the edge potential $\psi(t)=\cosh t-1,$ we minimize $\sum_{e\in E^\to}\psi(z_e)$ over each affine class $\omega+dC^0(G)\subset C^1(G)$. The minimizer is…

The unit-derived method in coding theory is shown to be a unique optimal scheme for constructing and analysing codes. In many cases efficient and practical decoding methods are produced. Codes with efficient decoding algorithms at maximal…

We study the projective dimensions of the restriction of functors Hom(-,X) to a contravariantly finite rigid subcategory T of a triangulated category C. We show that the projective dimension of Hom(-,X)|T is at most one if and only if there…

The Allen-Cahn equation with Flory-Huggins potential is a fundamental and crucial model in phase field simulation for describing phase separation phenomena, which serves as a core tool in diverse branches of natural sciences. The numerical…

Many entanglement measures are first defined for pure states of a bipartite Hilbert space, and then extended to mixed states via the convex roof extension. In this article we alter the convex roof extension of an entanglement measure, to…

Valiant's Holant theorem is a powerful tool for algorithms and reductions for counting problems. It states that if two sets $\mathcal{F}$ and $\mathcal{G}$ of tensors (a.k.a. constraint functions or signatures) are related by a…

A code is a subset of the vertex set of a Hamming graph. The set of $s$-neighbours of a code is the set of all vertices at Hamming distance $s$ from their nearest codeword. A code $C$ is $s$-elusive if there exists a distinct code $C'$ that…

We present an algorithm that, given a channel, determines if there is a distance for it such that the maximum likelihood decoder coincides with the minimum distance decoder. We also show that any metric, up to a decoding equivalence, can be…

We study a generalization of the Erd\H{o}s-Falconer distance problem over finite fields. For a graph $G$, two embeddings $p, p': V(G) \to \mathbb{F}_q^d$ of a graph $G$ are congruent if for all edges $(v_i, v_j)$ of $G$ we have that…

Let $K\subseteq\mathbb{R}$ be the unique attractor of an iterated function system. We consider the case where $K$ is an interval and study those elements of $K$ with a unique coding. We prove under mild conditions that the set of points…

We present a new decoding algorithm based on error locating pairs and correcting an amount of errors exceeding half the minimum distance. When applied to Reed--Solomon or algebraic geometry codes, the algorithm is a reformulation of the…

In this paper, we show that given a nontrivial concircular vector field $\boldsymbol{u}$ on a Riemannian manifold $(M,g)$ with potential function $f$, there exists a unique smooth function $\rho $ on $M$ that connects $\boldsymbol{u}$ to…

The main result (roughly) is that if (H_i) converges weakly to H and if also f(H_i) converges weakly to f(H), for a single strictly convex continuous function f, then (H_i) must converge strongly to H. One application is that if f(pr(H)) =…

This work studies the angular component $ \pi_{t} = u_{t} / \| u_{t} \| $ associated to the solution $ u $ of a vector-valued linear hyperviscous SPDE on a $d$-dimensional torus $$\mathrm{d} u^{\alpha} =- \nu^{\alpha} (- \Delta)^{\mathbf{a}…