English
Related papers

Related papers: Recursive Structure of Hulls of PRM Codes

200 papers

Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two…

Combinatorics · Mathematics 2019-03-07 J. Borges , J. Rifà , V. A. Zinoviev

Let r mod m be the least positive residue of r modulo m, and set the height of a pair (r,s) of integers, both relatively prime to m, to be the minimum over k, with 0<k<m, of (k r mod m) + (k s mod m). Denote this quantity by h(m,r,s). We…

Number Theory · Mathematics 2010-03-04 Kevin O'Bryant

Reed-Muller (RM) codes and polar codes are generated by the same matrix $G_m= \bigl[\begin{smallmatrix}1 & 0 \\ 1 & 1 \\ \end{smallmatrix}\bigr]^{\otimes m}$ but using different subset of rows. RM codes select simply rows having largest…

Information Theory · Computer Science 2019-02-01 Emmanuel Abbe , Min Ye

Let $H$ be a commutative semigroup with unit element such that every non-unit can be written as a finite product of irreducible elements (atoms). For every $k \in \mathbb N$, let $\mathscr U_k (H)$ denote the set of all $\ell \in \mathbb N$…

Commutative Algebra · Mathematics 2018-05-15 Yushuang Fan , Alfred Geroldinger , Florian Kainrath , Salvatore Tringali

Here we consider the $q$-series coming from the Hall-Littlewood polynomials, \begin{equation*} R_\nu(a,b;q)=\sum_{\substack{\lambda \\[1pt] \lambda_1\leq a}} q^{c|\lambda|} P_{2\lambda}\big(1,q,q^2,\dots;q^{2b+d}\big). \end{equation*} These…

Combinatorics · Mathematics 2022-06-22 Claire Frechette , Madeline Locus

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, Espa\~nol and the authors. We show that the notion of Krull…

Commutative Algebra · Mathematics 2018-01-03 Thierry Coquand , Henri Lombardi

The second weight of the Generalized Reed-Muller code of order $d$ over the finite field with $q$ elements is now known for $d <q$ and $d>(n-1)(q-1)$. In this paper, we determine the second weight for the other values of $d$ which are not…

Information Theory · Computer Science 2009-06-30 Robert Rolland

In this paper, we introduce the power-partible reduction for holonomic (or, P-recursive) sequences and apply it to obtain a series of congruences for Ap\'ery numbers $A_k$. In particular, we prove that, for any $r\in\mathbb{N}$, there…

Combinatorics · Mathematics 2024-07-16 Rong-Hua Wang , Michael X. X. Zhong

Interest in the hulls of linear codes has been growing rapidly. More is known when the inner product is Euclidean than Hermitian. A shift to the latter is gaining traction. The focus is on a code whose Hermitian hull dimension and dual…

Information Theory · Computer Science 2025-12-22 Lin Sok , Martianus Frederic Ezerman , Ling San

It is known that the complex Grassmannian of $k$-dimensional subspaces can be identified with the set of projection matrices of rank $k$. It is also classically known that the convex hull of this set is the set of Hermitian matrices with…

Combinatorics · Mathematics 2024-03-19 Kazumasa Narita

We find a combinatorial setting for the coefficients of the Boros-Moll polynomials $P_m(a)$ in terms of partially 2-colored permutations. Using this model, we give a combinatorial proof of a recurrence relation on the coefficients of…

Combinatorics · Mathematics 2010-08-30 William Y. C. Chen , Sabrina X. M. Pang , Ellen X. Y. Qu

The partition perimeter is a statistic defined to be one less than the sum of the number of parts and the largest part. Recently, Amdeberhan, Andrews, and Ballantine proved the following analog of Glaisher's theorem: for all $m \geq 2$ and…

Combinatorics · Mathematics 2023-09-06 Hunter Waldron

We introduce the notion of logarithmically concave (or log-concave) sequences in Coding Theory. A sequence $a_0, a_1, \dots, a_n$ of real numbers is called log-concave if $a_i^2 \ge a_{i-1}a_{i+1}$ for all $1 \le i \le n-1$. A natural…

Information Theory · Computer Science 2024-10-08 Minjia Shi , Xuan Wang , Junmin An , Jon-Lark Kim

For each integer partition $\mathbf{q}$ with $d$ parts, we denote by $\Delta_{(1,\mathbf{q})}$ the lattice simplex obtained as the convex hull in $\mathbb{R}^d$ of the standard basis vectors along with the vector $-\mathbf{q}$. For…

Combinatorics · Mathematics 2020-10-27 Benjamin Braun , Derek Hanely

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

Combinatorics · Mathematics 2016-11-01 Franck Gabriel

Let $G$ be a connected graph and let $\mathbb{X}$ be the set of projective points defined by the column vectors of the incidence matrix of $G$ over a field $K$ of any characteristic. We determine the generalized Hamming weights of the…

Commutative Algebra · Mathematics 2019-08-20 Jose Martinez-Bernal , Miguel A. Valencia-Bucio , Rafael H. Villarreal

By a very simple argument, we prove that if $l,m,n$ are nonnegative integers then $$\sum_{k=0}^l(-1)^{m-k}\binom{l}{k}\binom{m-k}{n}\binom{2k}{k-2l+m} =\sum_{k=0}^l\binom{l}{k}\binom{2k}{n}\binom{n-l}{m+n-3k-l}. On the basis of this…

Combinatorics · Mathematics 2007-05-23 Hao Pan , Zhi-Wei Sun

Let $(R,\mathfrak m)$ be a Cohen-Macaulay local ring of dimension $d\geq 2$ and $I$ an $\mathfrak m$-primary ideal. Let rd$(I)$ be the reduction number of $I$ and n$(I)$ the postulation number. We prove that for $d=2,$ if n$(I)=\rho(I)-1,$…

Commutative Algebra · Mathematics 2026-03-19 Mousumi Mandal , Shruti Priya

In the article "Construction of the continuous hull for the combinatorics of a regular pentagonal tiling of the plane" we constructed the continuous hull for the combinatorics of "A regular pentagonal tiling of the plane", and in the…

Dynamical Systems · Mathematics 2013-05-07 Maria Ramirez-Solano

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

Number Theory · Mathematics 2012-04-10 Victor J. W. Guo , Jiang Zeng
‹ Prev 1 3 4 5 6 7 10 Next ›