English
Related papers

Related papers: Recursive Structure of Hulls of PRM Codes

200 papers

Sylvester showed that the partition of an integer into a set of positive integers can be represented as a sum of the polynomial term and quasiperiodic components called the Sylvester waves. The wave itself is a weighted sum of the…

Number Theory · Mathematics 2026-03-09 Boris Y. Rubinstein

The hull perimeter at distance d in a planar map with two marked vertices at distance k from each other is the length of the closed curve separating these two vertices and lying at distance d from the first one (d<k). We study the…

Combinatorics · Mathematics 2017-11-20 Emmanuel Guitter

Given a power $q$ of a prime number $p$ and "nice" polynomials $f_1,...,f_r\in\bbF_q[T,X]$ with $r=1$ if $p=2$, we establish an asymptotic formula for the number of pairs $(a_1,a_2)\in\bbF_q^2$ such that…

Number Theory · Mathematics 2012-03-06 Lior Bary-Soroker , Moshe Jarden

Combinatorial number system represents a non-negative natural numbers as sum of binomial coefficients. This paper presents an induction proof that there exists unique representation of every non-negative natural number $m$ as sum of $r$…

Combinatorics · Mathematics 2016-01-25 Abu Bakar Siddique , Saadia Farid , Muhammad Tahir

We use twistor theory to identify the harmonic hull of an arbitrary connected open subset U of R^{2m} for m at least 2. It is the natural domain of analytic continuation in C^{2m} for harmonic functions on U.

Differential Geometry · Mathematics 2011-02-07 Michael Eastwood , Feng Xu

Let $R$ be a commutative Noetherian ring, $E$ a non-zero finitely generated $R$-module and $I$ an ideal of $R$. One purpose of this paper is to show that the sequences $\Ass_RE/ \widetilde{I_E^n}$ and $\Ass_R\widetilde{I^n…

Commutative Algebra · Mathematics 2016-07-27 Monireh Sedghi

The second moments of the quark structure functions of the longitudinally and transversally polarized rho-mesons are calculated in the framework of QCD sum rules in external fields. Operators of dimension 4 and 6 are taken into account. The…

High Energy Physics - Phenomenology · Physics 2010-02-03 A. Oganesian , A. Samsonov

Coset constructions of $q$-ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the system can obtain information while still allowing for local…

Information Theory · Computer Science 2015-11-04 Olav Geil , Stefano Martin

Let $p$ be a prime number. Irreducible cyclic codes of length $p^2-1$ and dimension $2$ over the integers modulo $p^h$ are shown to have exactly two nonzero Hamming weights. The construction uses the Galois ring of characteristic $p^h$ and…

Information Theory · Computer Science 2019-11-19 Minjia Shi , Tor Helleseth , Patrick Sole

We study properties of convex hulls of (co)adjoint orbits of compact groups, with applications to invariant theory and tensor product decompositions. The notion of partial convex hulls is introduced and applied to define two numerical…

Representation Theory · Mathematics 2024-02-22 Valdemar V. Tsanov

In this paper, we consider the hull of an algebraic geometry code, meaning the intersection of the code and its dual. We demonstrate how codes whose hulls are algebraic geometry codes may be defined using only rational places of Kummer…

Information Theory · Computer Science 2024-02-06 Eduardo Camps , Hiram H. López , Gretchen L. Matthews

Let $r\geq 3$ be a positive integer and $\mathbb{F}_q$ the finite field with $q$ elements. In this paper, we consider the $r$-regular complete permutation property of maps with the form $f=\tau\circ\sigma_M\circ\tau^{-1}$ where $\tau$ is a…

Information Theory · Computer Science 2022-12-29 Wei Lu , Xia Wu , Yufei Wang , Xiwang Cao

This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem POLYTOPE-COMPLETENESS-COMBINATORIAL, which in turn can be solved by a simplicial homology computation. Like…

Metric Geometry · Mathematics 2007-05-23 Michael Joswig , G"unter M. Ziegler

We derive $p$-adic expansions for the generalized Harmonic numbers $H^{(j)}_{p-1}$ and $H^{(j)}_{\frac{p-1}{2}}$ involving the Bernoulli numbers $B_j$ and the the base-2 Fermat quotient $q_p$. While most of our results are not new, we…

Number Theory · Mathematics 2019-02-15 René Gy

Let $\mathbb{F}_{2^m}$ be a finite field of $2^m$ elements, and $R=\mathbb{F}_{2^m}[u]/\langle u^k\rangle=\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}+\ldots+u^{k-1}\mathbb{F}_{2^m}$ ($u^k=0$) where $k$ is an integer satisfying $k\geq 2$. For any odd…

Information Theory · Computer Science 2019-10-08 Yonglin Cao , Yuan Cao , Fang-Wei Fu

We consider a large class of $q$-series that have the structure of Nahm sums, or equivalently motivic generating series for quivers. First, we initiate a systematic analysis and classification of classical and quantum A-polynomials…

High Energy Physics - Theory · Physics 2020-08-26 Helder Larraguivel , Dmitry Noshchenko , Miłosz Panfil , Piotr Sułkowski

By considering the tiling of an $N$-board (a linear array of $N$ square cells of unit width) with new types of tile that we refer to as combs, we give a combinatorial interpretation of the product of two consecutive generalized Fibonacci…

Combinatorics · Mathematics 2024-09-04 Michael A. Allen , Kenneth Edwards

We determine the weight spectra of the Reed-Muller codes $RM(m-3,m)$ for $m\ge 6$ and $RM(m-4,m)$ for $m\ge 8$. The technique used is induction on $m$, using that the sum of two weights in $RM(r-1,m-1)$ is a weight in $RM(r,m)$, and using…

Information Theory · Computer Science 2023-07-06 Claude Carlet , Patrick Solé

The weight spectra of the Reed-Muller codes $RM(r,m)$ were unknown for $r=3,...,m-5$. In IEEE Trans. Inform. Theory 2024, Carlet determined the weight spectrum of $RM(m-5,m)$ for $m\ge10$ using the Maiorana-McFarland construction, where the…

Information Theory · Computer Science 2024-06-07 Yueying Lou , Qichun Wang

We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible complexity.

Information Theory · Computer Science 2017-03-17 Ilya Dumer , Kirill Shabunov
‹ Prev 1 4 5 6 7 8 10 Next ›