Related papers: Recursive Structure of Hulls of PRM Codes
It is proven that for any numbers n=2^m-1, m >= 4 and r, such that n - log(n+1)<= r <= n excluding n = r = 63, n = 127, r in {126,127} and n = r = 2047 there exists a propelinear perfect binary code of length n and rank r.
The hull of a linear code is defined as the intersection of the code and its dual. This concept was initially introduced to classify finite projective planes. The hull plays a crucial role in determining the complexity of algorithms used to…
A recursive construction is presented for the projective cubature formulas of index $p$ on the unit spheres $S(m,K)\subset K^m$ where $K$ is $R$ or $C$, or $H$. This yields a lot of new upper bounds for the minimal number of nodes…
The classical theorem of Wendel provides an exact formula for the probability that the convex hull of independent symmetrically distributed vectors in ${\mathbb R}^d$ contains the origin as long as the distributions of the vectors are…
In this paper, we present some criteria for the $2$-$q$-log-convexity and $3$-$q$-log-convexity of combinatorial sequences, which can be regarded as the first column of certain infinite triangular array $[A_{n,k}(q)]_{n,k\geq0}$ of…
Let $h_n(v)$ be the sequence of rational functions with $$ \frac{h_n(v)}{v}-nh_n(v)+(n-1)h_{n-1}(v)-vh_{n-1}'(v)+\frac{v(v(vh_{n-1}(v))')'}{4}=0 $$ for $n>0$ and $h_0(v)=1$. We prove that $h_n(v)$ has a pole at $v=\frac{1}{n}$ if and only…
We develop a recursive scheme, as well as polynomial forms (polynomials in $n$ of degree $m$), for the evaluation of Ledin and Brousseau's Fibonacci sums of the form $S(m,n,r)=\sum_{k=1}^nk^mF_{k + r}$, $T(m,n,r)=\sum_{k=1}^nk^mL_{k + r}$…
We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…
We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some…
Binary Reed-Muller (RM) codes are defined via evaluations of Boolean-valued functions on $\mathbb{Z}_2^m$. We introduce a class of binary linear codes that generalizes the RM family by replacing the domain $\mathbb{Z}_2^m$ with an arbitrary…
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…
Let $G=C_n\oplus C_n$ and let $k\in [0,n-1]$. We study the structure of sequences of terms from $G$ with maximal length $|S|=2n-2+k$ that fail to contain a nontrivial zero-sum subsequence of length at most $2n-1-k$. For $k\leq 1$, this is…
Block codes are considered for improving the reliability of messages stored in a computer memory with both stuck-at defects and random errors. It is assumed that the side information about the state of the defects is available to the…
For any number $m \equiv 0,1 \, (4)$ we correct the generating function of Hurwitz class number sums $\sum_r H(4n - mr^2)$ to a modular form (or quasimodular form if $m$ is a square) of weight two for the Weil representation attached to a…
Let $X_1,\ldots, X_{d+2}$ be random points in $\mathbb R^d$. The classical Sylvester problem asks to determine the probability that the convex hull of these points, denoted by $P:= [X_1,\ldots, X_{d+2}]$, is a simplex. In the present paper,…
Let $Y$ be a projective submanifold of the total space of the inverse of a very ample line bundle $\pi:L^{-1}\rightarrow B$ over a projective manifold $B$. Any section of $L^{-1}\rightarrow B$ is isomorphic to $B$ and the Hodge numbers of…
In this paper, using the well-known Karlsson-Minton formula, we mainly establish two divisibility results concerning truncated hypergeometric series. Let $n>2$ and $q>0$ be integers with $2\mid n$ or $2\nmid q$. We show that…
In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence…
The Schur square of linear codes over a finite field has emerged as a fundamental operation in both classical and quantum coding theory. In this paper, we investigate the Schur square problem of Hyperderivative Reed-Solomon (HRS) codes. By…
In this paper, we introduce and study the $q$-Krull dimension of a commutative ring via its $q$-operation. A new characterization of $\tau_q$-von Neumann regular rings is obtained, and some properties of rings $q$-Krull dimension 0 are…