Related papers: The Covering Radius of the Third-Order Reed-Muller…
In 1981, Schatz proved that the covering radius of the binary Reed-Muller code $RM(2,6)$ is 18. For $RM(2,7)$, we only know that its covering radius is between 40 and 44. In this paper, we prove that the covering radius of the binary…
It was proved by J. Schatz that the covering radius of the second order Reed--Muller code $RM(2, 6)$ is 18 (IEEE Trans Inf Theory 27: 529--530, 1985). However, the covering radius of $RM(2,7)$ has been an open problem for many years. In…
We present methods for computing the distance from a Boolean polynomial on $m$ variables of degree $m-3$ (i.e., a member of the Reed-Muller code $RM(m-3,m)$) to the space of lower-degree polynomials ($RM(m-4,m)$). The methods give…
In 2006, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the bent concatenation bound of 240, have been discovered in the class of Rotation Symmetric Boolean Functions (RSBFs) by Kavut, Maitra and Yucel.…
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…
Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important problem in cryptography, coding theory, and computational complexity. We prove lower bounds on the second-order, third-order, and higher-order…
In this work we study metric properties of the well-known family of binary Reed-Muller codes. Let $A$ be an arbitrary subset of the Boolean cube, and $\widehat{A}$ be the metric complement of $A$ -- the set of all vectors of the Boolean…
We generalize to any q a theorem about covering radius of linear codes proved by Helleseth, Klove and Mykkelvit. Then we determine the covering radius of first order generalized Reed-Muller codes in second order generalized Reed-Muller…
Let $R(r,n)$ be the $r$th order Reed-Muller code of length $2^n$. The affine linear group $\text{AGL}(n,\Bbb F_2)$ acts naturally on $R(r,n)$. We derive two formulas concerning the number of orbits of this action: (i) an explicit formula…
We propose an effective version of the lift by derivation, an invariant that allows us to provide the classification of B(5,6,8)=RM(6, 8)/RM(4,8). The main consequence is to establish that the covering radius of the Reed-Muller RM(4,8) is…
The r-th order nonlinearity of a Boolean function is the minimum number of elements that have to be changed in its truth table to arrive at a Boolean function of degree at most r. It is shown that the (suitably normalised) r-th order…
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…
The deep holes of a linear code are the vectors that achieve the maximum error distance (covering radius) to the code. {Determining the covering radius and deep holes of linear codes is a fundamental problem in coding theory. In this paper,…
An $(n,R)$-covering sequence is a cyclic sequence whose consecutive $n$-tuples form a code of length $n$ and covering radius $R$. Using several construction methods improvements of the upper bounds on the length of such sequences for $n…
MDS codes have diverse practical applications in communication systems, data storage, and quantum codes due to their algebraic properties and optimal error-correcting capability. In this paper, we focus on a class of linear codes and…
A $\lambda$-fold $r$-packing (multiple radius-$r$ covering) in a Hamming metric space is a code $C$ such that the radius-$r$ balls centered in $C$ cover each vertex of the space by not more (not less, respectively) than $\lambda$ times. The…
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 study the problem of realising modular invariants by braided subfactors and the related problem of classifying nimreps. We develop the fusion rule structure of these modular invariants. This structure is useful tool in the analysis of…
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$)…
In this paper we present a family of $q$-ary nonlinear quasi-perfect codes with covering radius 2. The codes have length $n = q^m$ and size $ M = q^{n - m - 1}$ where $q$ is a prime power, $q \geq 3$, $m$ is an integer, $m \geq 2$. We prove…