English
Related papers

Related papers: A tight upper bound on the number of non-zero weig…

200 papers

We derive constraints on two-dimensional conformal field theories with higher spin symmetry due to unitarity, modular invariance, and causality. We focus on CFTs with $\mathcal{W}_N$ symmetry in the "irrational" regime, where $c>N-1$ and…

High Energy Physics - Theory · Physics 2018-06-13 Nima Afkhami-Jeddi , Kale Colville , Thomas Hartman , Alexander Maloney , Eric Perlmutter

It is well known that the problem of determining the weight distributions of families of cyclic codes is, in general, notoriously difficult. An even harder problem is to find characterizations of families of cyclic codes in terms of their…

Information Theory · Computer Science 2015-08-21 Gerardo Vega

Constacyclic codes over finite fields are of theoretical importance as they are closely related to a number of areas of mathematics such as algebra, algebraic geometry, graph theory, combinatorial designs and number theory. However, the…

Information Theory · Computer Science 2026-05-08 Hongsheng Hu , Nian Li , Yanan Wu , Xiangyong Zeng

We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…

Information Theory · Computer Science 2022-09-29 Angelo Marotta

A code $C$ in the Hamming metric, that is, is a subset of the vertex set $V\varGamma$ of the Hamming graph $\varGamma=H(m,q)$, gives rise to a natural distance partition $\{C,C_1,\ldots,C_\rho\}$, where $\rho$ is the covering radius of $C$.…

Combinatorics · Mathematics 2022-08-02 Robert F. Bailey , Daniel R. Hawtin

Cyclic codes have efficient encoding and decoding algorithms. The decoding error probability and the undetected error probability are usually bounded by or given from the weight distributions of the codes. Most researches are about the…

Information Theory · Computer Science 2013-09-03 Xiaogang Liu , Yuan Luo

Let $\mathbb{F}_{p^{m}}$ be a finite field with cardinality $p^{m}$ and $R=\mathbb{F}_{p^{m}}+u\mathbb{F}_{p^{m}}$ with $u^{2}=0$. We aim to determine all $\alpha+u\beta$-constacyclic codes of length $np^{s}$ over $R$, where…

Information Theory · Computer Science 2016-06-22 Wei Zhao , Xilin Tang , Ze Gu

We present several results in the CONGEST model on round complexity for Replacement Paths (RPaths), Minimum Weight Cycle (MWC), and All Nodes Shortest Cycles (ANSC). We study these fundamental problems in both directed and undirected…

Data Structures and Algorithms · Computer Science 2024-05-22 Vignesh Manoharan , Vijaya Ramachandran

Irreducible cyclic codes are an interesting type of codes and have applications in space communications. They have been studied for decades and a lot of progress has been made. The objectives of this paper are to survey and extend earlier…

Information Theory · Computer Science 2011-08-22 Cunsheng Ding , Jing Yang

There is a local ring $E$ of order $4,$ without identity for the multiplication, defined by generators and relations as $E=\langle a,b \mid 2a=2b=0,\, a^2=a,\, b^2=b,\,ab=a,\, ba=b\rangle.$ We study a special construction of self-orthogonal…

Information Theory · Computer Science 2021-06-15 Minjia Shi , Shukai Wang , Jon-Lark Kim , Patrick Solé

Let $M$ be a closed, orientable hyperbolic 3-manifold and $\phi$ a homomorphism of its fundamental group onto $\mathbb{Z}$ that is not induced by a fibration over the circle. For each natural number $n$ we give an explicit lower bound,…

Geometric Topology · Mathematics 2016-07-20 Jason DeBlois

In the area of symbolic-numerical computation within computer algebra, an interesting question is how "close" a random input is to the "critical" ones, like the singular matrices in linear algebra or the polynomials with multiple roots for…

Algebraic Geometry · Mathematics 2019-07-19 Joachim von zur Gathen , Guillermo Matera

For a simple module $M$ over the positive part of the Virasoro algebra (actually for any simple module over some finite dimensional solvable Lie algebras $\mathfrak{a}_r$) and any $\alpha\in\C$, a class of weight modules $\mathcal {N}(M,…

Representation Theory · Mathematics 2019-08-08 Genqiang Liu , Rencai Lu , Kaiming Zhao

In a very interesting paper, Andr\'easson has recently proved that the gravitational mass of a spherically symmetric compact object of radius $R$ and electric charge $Q$ is bounded from above by the relation…

General Relativity and Quantum Cosmology · Physics 2019-04-03 Shahar Hod

We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective…

Information Theory · Computer Science 2025-01-08 Chiara Castello , Heide Gluesing-Luerssen , Olga Polverino , Ferdinando Zullo

This study aims to determine the algebraic structures of $\alpha$-constacyclic codes of length $3p^s$ over the finite commutative non-chain ring $\mathcal{R}=\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}$, for a prime $p…

Combinatorics · Mathematics 2025-04-03 Divya Acharya , Prasanna Poojary , Vadiraja Bhatta G R

For any prime $p$, $\lambda$-constacyclic codes of length $p^s$ over ${\cal R}=\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}$ are precisely the ideals of the local ring ${\cal R}_{\lambda}=\frac{{\cal R}[x]}{\left\langle x^{p^s}-\lambda…

Information Theory · Computer Science 2016-12-13 Hongwei Liu , Maouche Youcef

Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…

Information Theory · Computer Science 2009-01-09 Eric Z. Chen

We study the rank weight hierarchy of linear codes which are stable under a linear endomorphism defined over the base field, in particular when the endomorphism is cyclic. In this last case, we give a necessary and sufficient condition for…

Information Theory · Computer Science 2026-02-02 G. Berhuy , J. Molina

The 3-uniform tight cycle $C_s^3$ has vertex set $ Z_s$ and edge set $\{\{i, i+1, i+2\}: i \in Z_s\}$. We prove that for every $s \not\equiv 0$ (mod 3) and $s \ge 16$ or $s \in \{8,11,14\}$ there is a $c_s>0$ such that the 3-uniform…

Combinatorics · Mathematics 2016-08-10 Dhruv Mubayi