Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.04688

Decoding Error Probability of the Random Code Ensemble over the Erasure Channel

Chin Hei Chan
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we provide explicit formulas for the average decoding error probabilities of the ensemble of all $(n,M)_q$ codes over the erasure channel under unambiguous, list and maximum-likelihood decoding principles. Moreover, we derive the asymptotic error exponents for the ensemble of all $(n,q^{Rn})_q$ codes.

Explore related subjects

cs.ITmath.IT

Keep this discovery

BibTeXRIS

Chin Hei Chan. 2026-09-04. Decoding Error Probability of the Random Code Ensemble over the Erasure Channel. https://arxiv.org/abs/2609.04688

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.IT subjectmath.IT subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2005

The maximum entropy state

We give an algorithm for calculating the maximum entropy state as the least fixed point of a Scott continuous mapping on the domain of classical states in their Bayesian order.

math.PR↗
arXiv2026

Eigenvalues and eigenfunctions of the fractional Laplacian on the interval

We prove a three-term asymptotic formula for the eigenvalues of the fractional Laplacian on the bounded interval $(-1,1)$. This improves the eigenvalue asymptotics of Kulczycki--Kwaśnicki--Małecki--Stós and Kwaśnicki, and confirms the conjectural $O_α(n^{-2})$ remainder suggested by the numerical simulations of Kaleta--Kwaśnicki--Małecki. Moreover, we prove that the normalized eigenfunctions are bounded uniformly in the eigenvalue index $n$ and the fractional order $α$. This settles the conjecture proposed by Kwaśnicki through numerical experiments. Furthermore, we prove that the $n$-th eigenfunction has exactly $n-1$ zeros in the interval $(-1,1)$ and every zero is simple, and hence there are exactly $n$ nodal domains. A key ingredient in the proof is an explicit representation of the eigenfunction.

math.CA↗
arXiv2025

Turing complete Navier-Stokes steady states via cosymplectic geometry

In this article, we construct stationary solutions to the Navier-Stokes equations on certain Riemannian $3$-manifolds that exhibit Turing completeness, in the sense that they are capable of performing universal computation. This universality arises on manifolds admitting nonvanishing harmonic 1-forms, thus showing that computational universality is not obstructed by viscosity, provided the underlying geometry satisfies a mild cohomological condition. The proof makes use of a correspondence between nonvanishing harmonic $1$-forms and cosymplectic geometry, which extends the classical correspondence between Beltrami fields and Reeb flows on contact manifolds.

math.DG↗