Related papers: Covering radius of RM(4,8)
In this paper we study the covering numbers of the space of convex and uniformly bounded functions in multi-dimension. We find optimal upper and lower bounds for the $\epsilon$-covering number of $\C([a, b]^d, B)$, in the $L_p$-metric, $1…
Discrete de Rham (DDR) methods provide non-conforming but compatible approximations of the continuous de Rham complex on general polytopal meshes. Owing to the non-conformity, several challenges arise in the analysis of these methods. In…
The covering number of an associative ring $R$ is the minimal number of proper subrings whose union is $R$. We establish a strategy to classify unital rings of a given finite covering number, and obtain a classification of unital rings…
We try to find all quadruples of positive integers $(m,a,b,c)$ with $a \geq b \geq c$ such that there exists a distinct covering system with minimum modulus $m$ and least common multiple of the moduli $2^a 3^b 5^c$. We obtain complete…
Interferometric tests of a f/1.2 2.5-m diameter liquid mirror show RMS surface deviations about wave/20 and Strehl ratios of order 0.6, showing that it is diffraction limited. The mirror is certainly better than implied by the data because…
The list decoding problem for a code asks for the maximal radius up to which any ball of that radius contains only a constant number of codewords. The list decoding radius is not well understood even for well studied codes, like…
We give an extension to a nonconvex setting of the classical radial representation result for lower semicontinuous envelope of a convex function on the boundary of its effective domain. We introduce the concept of radial uniform upper…
The covering radius problem is a question in coding theory concerned with finding the minimum radius $r$ such that, given a code that is a subset of an underlying metric space, balls of radius $r$ over its code words cover the entire metric…
The covering radius of permutation group codes are studied in this paper with $l_{\infty}$-metric. We determine the covering radius of the $(p,q)$-type group, which is a direct product of two cyclic transitive groups. We also deduce the…
We consider recursive decoding for Reed-Muller (RM) codes and their subcodes. Two new recursive techniques are described. We analyze asymptotic properties of these algorithms and show that they substantially outperform other decoding…
This work proves new results on the ability of binary Reed-Muller codes to decode from random errors and erasures. We obtain these results by proving improved bounds on the weight distribution of Reed-Muller codes of high degrees.…
Let $\mathcal{M}_{g,\epsilon}$ be the $\epsilon$-thick part of the moduli space $\mathcal{M}_g$ of closed genus $g$ surfaces. In this article, we show that the number of balls of radius $r$ needed to cover $\mathcal{M}_{g,\epsilon}$ is…
We prove that every distinct covering system has a modulus divisible by either 2 or 3.
Deriving the Faraday rotation measure (RM) of quasar absorption line systems, which are tracers of high-redshift galaxies intervening background quasars, is a powerful tool for probing magnetic fields in distant galaxies. Statistically…
This paper gives lower and upper bounds on the covering radius of codes over $\Z_{2^s}$ with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type $\alpha$ and Type $\beta$)…
We propose an easy-to-implement hard-decision majority-logic decoding algorithm for Reed-Muller codes RM(r,m) with m >= 3, m/2 >= r >= 1. The presented algorithm outperforms the best known majority-logic decoding algorithms and offers…
The largest Hamming distance between a Boolean function in $n$ variables and the set of all affine Boolean functions in $n$ variables is known as the covering radius $\rho_n$ of the $[2^n,n+1]$ Reed-Muller code. This number determines how…
Reed-Muller codes encode an $m$-variate polynomial of degree $r$ by evaluating it on all points in $\{0,1\}^m$. We denote this code by $RM(m,r)$. The minimal distance of $RM(m,r)$ is $2^{m-r}$ and so it cannot correct more than half that…
Radiative decays of the B meson are known to provide important constraints on the MSSM and many other realistic new physics models in the sub-TeV range. The inclusive branching ratio BR(B -> Xs gamma) being the key observable is currently…
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to…