English
Related papers

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

200 papers

A fundamental property of codes, the second-order weight distribution, is proposed to solve the problems such as computing second moments of weight distributions of linear code ensembles. A series of results, parallel to those for weight…

Information Theory · Computer Science 2011-11-15 Shengtian Yang

We investigate topological T-duality in the framework of non-abelian gerbes and higher gauge groups. We show that this framework admits the gluing of locally defined T-duals, in situations where no globally defined ("geometric") T-duals…

Algebraic Topology · Mathematics 2022-02-25 Thomas Nikolaus , Konrad Waldorf

Two-weight linear codes are linear codes in which any nonzero codeword can have only two possible distinct weights. Those in the Hamming metric have proven to be very interesting for their connections with authentication codes, association…

Information Theory · Computer Science 2024-05-07 Ferdinando Zullo , Olga Polverino , Paolo Santonastaso , John Sheekey

Let $\Gamma_{F,n}$ be the Hermitian modular group of degree $n>1$ in sense of Hel Braun with respect to an imaginary quadratic field $F$. Let $r$ be a natural number. There exists a multiplier system of weight $1/r$ (equivalently a…

Number Theory · Mathematics 2020-11-10 Eberhard Freitag

In this paper, new few weights linear codes over the local ring $R=\mathbb{F}_p+u\mathbb{F}_p+v\mathbb{F}_p+uv\mathbb{F}_p,$ with $u^2=v^2=0, uv=vu,$ are constructed by using the trace function defined over an extension ring of degree $m.$…

Information Theory · Computer Science 2016-12-15 Shi Minjia , Qian Liqin , Sole Patrick

This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…

Commutative Algebra · Mathematics 2017-01-17 Ignacio García-Marco , Jorge L. Ramírez Alfonsín , Oystein J. Rodseth

We consider the geometric problem of determining the maximum number $n_q(r,h,f;s)$ of $(h-1)$-spaces in the projective space $\operatorname{PG}(r-1,q)$ such that each subspace of codimension $f$ does contain at most $s$ elements. In coding…

Combinatorics · Mathematics 2026-05-01 Jozefien D'haeseleer , Sascha Kurz

We give two algorithmic procedures to compute the whole set of almost symmetric numerical semigroups with fixed Frobenius number and type, and the whole set of almost symmetric numerical semigroups with fixed Frobenius number. Our…

Commutative Algebra · Mathematics 2018-11-16 M. B. Branco , I. Ojeda , J. C. Rosales

We establish rigidity for partial transformation groupoids associated with algebraic actions of semigroups: If two such groupoids (satisfying appropriate conditions) are isomorphic, then the globalizations of the initial algebraic actions…

Dynamical Systems · Mathematics 2026-04-14 Chris Bruce , Xin Li

For any numerical semigroup $S$, there are infinitely many numerical symmetric semigroups $T$ such that $S=\frac{T}{2}$ is their half. We are studying the Betti numbers of the numerical semigroup ring $K[T]$ when $S$ is a 3-generated…

Commutative Algebra · Mathematics 2011-11-08 Vincenzo Micale , Anda Olteanu

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

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

We construct a four-parameter family of affine Yangian algebras by gluing two copies of the affine Yangian of $\mathfrak{gl}_1$. Our construction allows for gluing operators with arbitrary (integer or half integer) conformal dimension and…

High Energy Physics - Theory · Physics 2020-01-08 Wei Li , Pietro Longhi

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

Analysis of the Berlekamp-Massey-Sakata algorithm for decoding one-point codes leads to two methods for improving code rate. One method, due to Feng and Rao, removes parity checks that may be recovered by their majority voting algorithm.…

Information Theory · Computer Science 2007-07-16 Maria Bras-Amorós , Michael E. O'Sullivan

We show that any two homogeneous affine semigroups can be glued by embedding them suitably in a higher dimensional space. As a consequence, we show that the sum of their homogeneous toric ideals is again a homogeneous toric ideal, and that…

Commutative Algebra · Mathematics 2024-02-28 Philippe Gimenez , Hema Srinivasan

In this study, linear codes having their Lee-weight distributions over the semi-local ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$ with $u^{2}=1$ are constructed using the defining set and Gauss sums for an odd prime $q $. Moreover, we derive…

Information Theory · Computer Science 2024-07-08 Pavan Kumar , Noor Mohammad Khan

We define generalized Hamming weights for almost affine codes. We show how various aspects and applications of generalized Hamming weights for linear codes, such as Wei duality, generalized Kung's bound, profiles, connection to wire-tap…

Information Theory · Computer Science 2017-03-20 Trygve Johnsen , Hugues Verdure

In this paper, for an odd prime $p$, by extending Li et al.'s construction \cite{CL2016}, several classes of two-weight and three-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from a defining set, and then their…

Information Theory · Computer Science 2021-07-07 Canze Zhu , Qunying Liao

We give an independent combinatorial proof of Nogin's Theorem concerning the minimum distance of the Grassmann codes using a special decomposition of the Grassmannians. We use the same idea to also compute the second minimum weight of the…

Combinatorics · Mathematics 2025-08-27 Mrinmoy Datta , Tiasa Dutta