English
Related papers

Related papers: The second Feng-Rao number for codes coming from i…

200 papers

A \emph{numerical semigroup} is a subset $\Lambda$ of the nonnegative integers that is closed under addition, contains $0$, and omits only finitely many nonnegative integers (called the \emph{gaps} of $\Lambda$). The collection of all…

Combinatorics · Mathematics 2024-03-21 Evan O'Dorney

This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of…

Information Theory · Computer Science 2014-11-18 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

In 2013, Zhai proved that most numerical semigroups of a given genus have depth at most $3$ and that the number $n_g$ of numerical semigroups of a genus $g$ is asymptotic to $S\varphi^g$, where $S$ is some positive constant and $\varphi…

Combinatorics · Mathematics 2023-09-15 Daniel G. Zhu

For numerical semigroups with a specified list of (not necessarily minimal) generators, we obtain explicit asymptotic expressions, and in some cases quasipolynomial/quasirational representations, for all major factorization length…

Combinatorics · Mathematics 2021-02-05 Stephan Ramon Garcia , Mohamed Omar , Christopher O'Neill , Samuel Yih

The pseudo-Frobenius numbers of a numerical semigroup are those gaps of the numerical semigroup that are maximal for the partial order induced by the semigroup. We present a procedure to detect if a given set of integers is the set of…

Commutative Algebra · Mathematics 2019-02-20 M. Delgado , P. A. García-Sánchez , A. M. Robles-Pérez

Second order asymptotics of fixed-length source coding and intrinsic randomness is discussed with a constant error constraint. There was a difference between optimal rates of fixed-length source coding and intrinsic randomness, which never…

Information Theory · Computer Science 2010-01-23 Masahito Hayashi

We determine de Weierstrass semigroup of a pair of certain rational points on the GK-curves. We use this semigroup to obtain two-point AG codes with better parameters than comparable one-point AG codes arising from these curves. These…

Algebraic Geometry · Mathematics 2015-07-24 Alonso Sepúlveda , Guilherme Tizziotti

We study the statistical behavior of entanglement in quantum bipartite systems over fermionic Gaussian states as measured by von Neumann entropy and entanglement capacity. The focus is on the variance of von Neumann entropy and the mean…

Mathematical Physics · Physics 2022-02-16 Youyi Huang , Lu Wei

We prove that the F-signature of an affine semigroup ring of positive characteristic is always a rational number, and describe a method for computing this number. We use this method to determine the F-signature of Segre products of…

Commutative Algebra · Mathematics 2007-05-23 Anurag K. Singh

The class of two-spin systems contains several important models, including random independent sets and the Ising model of statistical physics. We show that for both the hard-core (independent set) model and the anti-ferromagnetic Ising…

Probability · Mathematics 2012-03-13 Allan Sly , Nike Sun

Let $p$ be a prime number, $q=p^s$ for a positive integer $s$. For any positive divisor $e$ of $q-1$, we construct an infinite family codes of size $q^{2m}$ with few Lee-weight. These codes are defined as trace codes over the ring…

Information Theory · Computer Science 2017-12-05 Hongwei Liu , Youcef Maouche

Salazar, Dunn and Graham in [Salazar et. al., 2006] presented an improved Feng-Rao bound for the minimum distance of dual codes. In this work we take the improvement a step further. Both the original bound by Salazar et. al., as well as our…

Information Theory · Computer Science 2013-05-07 Olav Geil , Stefano Martin

A numerical semigroup is an additive submonoid of the natural numbers with finite complement. The size of the complement is called the genus of the semigroup. How many numerical semigroups have genus equal to $g$? We outline Zhai's proof of…

Combinatorics · Mathematics 2022-01-25 Nathan Kaplan

We investigate numerical semigroups generated by any quadratic sequence with initial term zero and an infinite number of terms. We find an efficient algorithm for calculating the Ap\'ery set, as well as bounds on the elements of the Ap\'ery…

Group Theory · Mathematics 2020-09-07 Mara Hashuga , Megan Herbine , Alathea Jensen

We present a simple method to establish the existence of asymptotically good sequences of iso-dual AG-codes. A key advantage of our approach, beyond its simplicity, is its flexibility, allowing it to be applied to a wide range of towers of…

Number Theory · Mathematics 2025-03-13 María Chara , Ricardo Podestá , Luciane Quoos , Ricardo Toledano

A numerical semigroup is a subset of N containing 0, closed under addition and with finite complement in N. An important example of numerical semigroup is given by the Weierstrass semigroup at one point of a curve. In the theory of…

Number Theory · Mathematics 2017-06-30 Maria Bras-Amorós

We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…

Combinatorics · Mathematics 2009-05-06 Sergi Elizalde

We develop the theory of patterns on numerical semigroups in terms of the admissibility degree. We prove that the Arf pattern induces every strongly admissible pattern, and determine all patterns equivalent to the Arf pattern. We study…

Commutative Algebra · Mathematics 2021-01-27 Alessio Borzì

In this article we present a heuristic model that describes the asymptotic behaviour of the number of primes p such that the p-th coefficient of a given eigenform is a rational integer. We treat the case of a weight 2 eigenform with…

Number Theory · Mathematics 2016-01-14 Jasper Van Hirtum

The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…

Combinatorics · Mathematics 2014-01-30 Thomas Honold