English
Related papers

Related papers: Recursive Structure of Hulls of PRM Codes

200 papers

A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at least k non-zeros and the supports of every two columns…

Combinatorics · Mathematics 2011-03-11 Boaz Barak , Zeev Dvir , Avi Wigderson , Amir Yehudayoff

In this paper, we revisit the Recursive Projection-Aggregation (RPA) decoder, of Ye and Abbe (2020), for Reed-Muller (RM) codes. Our main contribution is an explicit upper bound on the probability of incorrect decoding, using the RPA…

Information Theory · Computer Science 2025-05-27 V. Arvind Rameshwar , V. Lalitha

The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set $\{1,\ldots,n\}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation…

Discrete Mathematics · Computer Science 2018-12-11 Nevena Maric

For any non-negative integer $n$ and non-zero integer $r$, let $p_r(n)$ denote Ramanujan's general partition function. By employing $q$-identities, we prove some new Ramanujan-type congruences modulo 5 for $p_r(n)$ for $r=-(5\lambda+1),…

Number Theory · Mathematics 2020-08-17 Nipen Saikia , Jubaraj Chetry

We give two congruence properties of Hermitian modular forms of degree 2 over $\mathbb{Q}(\sqrt{-1})$ and $\mathbb{Q}(\sqrt{-3})$. The one is a congruence criterion for Hermitian modular forms which is generalization of Sturm's theorem.…

Number Theory · Mathematics 2010-05-18 Toshiyuki Kikuta

A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…

Combinatorics · Mathematics 2010-02-14 Barbara Baumeister , Christian Haase , Benjamin Nill , Andreas Paffenholz

For $m,q \in \mathbb{N}$, we call an $m$-tuple $(a_1,\ldots,a_m) \in \prod_{i=1}^m (\mathbb{Z}/q\mathbb{Z})^\times$ good if there are infinitely many consecutive primes $p_1,\ldots,p_m$ satisfying $p_i \equiv a_i \pmod{q}$ for all $i$. We…

Number Theory · Mathematics 2024-09-20 Cheuk Fung Lau

The normal ordering coefficients of strings consisting of $V,U$ which satisfy $UV=qVU+hV^s$ ($s\in\mathbb N$) are considered. These coefficients are studied in two contexts: first, as a multiple of a sequence satisfying a generalized…

Combinatorics · Mathematics 2014-08-21 Roberto B. Corcino , Ken Joffaniel M. Gonzales , Richell O. Celeste

We study congruences involving truncated hypergeometric series of the form_rF_{r-1}(1/2,...,1/2;1,...,1;\lambda)_{(mp^s-1)/2} = \sum_{k=0}^{(mp^s-1)/2} ((1/2)_k/k!)^r \lambda^k where p is a prime and m, s, r are positive integers. These…

Number Theory · Mathematics 2012-11-21 Jonas Kibelbek , Ling Long , Kevin Moss , Benjamin Sheller , Hao Yuan

The principal goal of the paper is to apply the approach inspired by the theory of integrable systems to construct explicit sections of line bundles over the combinatorial model of the moduli space of pointed Riemann surfaces based on…

Mathematical Physics · Physics 2018-07-03 M. Bertola , D. Korotkin

Let $\mu$ be a probability distribution on $\mathbb{R}^d$ which assigns measure zero to every hyperplane and $S$ a set of points sampled independently from $\mu$. What can be said about the expected combinatorial structure of the convex…

Probability · Mathematics 2023-07-13 Brett Leroux

The Krotov combining construction of perfect 1-error-correcting binary codes from 2000 and a theorem of Heden saying that every non-full-rank perfect 1-error-correcting binary code can be constructed by this combining construction is…

Information Theory · Computer Science 2011-05-06 Denis Krotov , Olof Heden

We present constructive versions of Krull's dimension theory for commutative rings and distributive lattices. The foundations of these constructive versions are due to Joyal, Espan\~ol and the authors. We show that this gives a constructive…

Commutative Algebra · Mathematics 2017-12-14 Thierry Coquand , Henri Lombardi

In this paper, we examine a class of doubly resolvable combinatorial objects. Let $t, k, \lambda, s$ and $v$ be nonnegative integers, and let $X$ be a set of $v$ symbols. A generalized Howell design, denoted $t$-$GHD_{k}(s,v;\lambda)$, is…

Combinatorics · Mathematics 2015-11-04 R. Julian R. Abel , Robert F. Bailey , Andrea C. Burgess , Peter Danziger , Eric Mendelsohn

We study a single particle which obeys non-relativistic quantum mechanics in R^N and has Hamiltonian H = -Delta + V(r), where V(r) = sgn(q)r^q. If N \geq 2, then q > -2, and if N = 1, then q > -1. The discrete eigenvalues E_{n\ell} may be…

Mathematical Physics · Physics 2009-11-10 Richard L. Hall , Qutaibeh D. Katatbeh

The spectral test of random number generators (R.R. Coveyou and R.D. McPherson, 1967) is generalized. The sequence of random numbers is analyzed explicitly, not just via their n-tupel distributions. We find that the mixed multiplicative…

Computational Physics · Physics 2008-02-03 Oliver Schnetz

In math.CO/0109093 the author obtained a formula for the value of an irreducible symmetric group character indexed by a partition of rectangular shape. In the present paper this formula is (conjecturally) generalized to arbitrary shapes.

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley

The purpose of this work is to geometrize the notion of mixed Hodge structure. Therefore, we associate equivariant vector bundles on the projective plane to trifiltered vector spaces. Making this Rees construction with filtrations arising…

Algebraic Geometry · Mathematics 2007-05-23 Olivier Penacchio

We provide q-generalizations of Spivey's Bell number formula in various settings by considering statistics on different combinatorial structures. This leads to new identities involving q-Stirling numbers of both kinds and q-Lah numbers. As…

Combinatorics · Mathematics 2014-12-04 Mark Shattuck

This paper investigates the hull codes of free linear codes over a non-unital ring $ E= \langle \kappa,\tau \mid 2 \kappa =2 \tau=0,~ \kappa^2=\kappa,~ \tau^2=\tau,~ \kappa \tau=\kappa,~ \tau \kappa=\tau \rangle$. Initially, we examine the…

Information Theory · Computer Science 2025-12-30 Anup Kushwaha , Om Prakash