English
Related papers

Related papers: Isometry-Dual Flags of AG Codes

200 papers

Given a finite group $G$ and an extension of finite chain rings $S|R$, one can consider the group rings $\mathscr{S} = S[G]$ and $\mathscr{R} = R[G]$. The group ring $\mathscr{S}$ can be viewed as an $R$-bimodule, and any of its…

Information Theory · Computer Science 2025-08-12 Maryam Bajalan , Javier de la Cruz , Alexandre Fotue Tabue , Edgar Martínez-Moro

Given an equivariant oriented cohomology theory $h$, a split reductive group $G$, a maximal torus $T$ in $G$, and a parabolic subgroup $P$ containing $T$, we explain how the $T$-equivariant oriented cohomology ring $h_T(G/P)$ can be…

Algebraic Geometry · Mathematics 2015-11-12 Baptiste Calmès , Kirill Zainoulline , Changlong Zhong

Given a locally compact Polish space X, a necessary and sufficient condition for a group G of homeomorphisms of X to be the full isometry group of (X,d) for some proper metric d on X is given. It is shown that every locally compact Polish…

Group Theory · Mathematics 2014-11-03 Piotr Niemiec

Previously, self-dual codes have been constructed from weighing matrices, and in particular from conference matrices (skew and symmetric). In this paper, codes constructed from matrices of skew symmetric type whose determinants reach the…

Information Theory · Computer Science 2013-11-13 José Andrés Armario , María Dolores Frau

It is proved in a reference (Fan, Lin, IEEE TIT, vol.67, pp.5016-5025) that the self-dual (LCD respectively) dihedral codes over a finite field~$F$ with ${|F|=q}$ are asymptotically good if $q$ is even (odd respectively). In this paper, we…

Information Theory · Computer Science 2023-03-02 Yun Fan , Yue Leng

We present multi-point algebraic geometric codes overstepping the Gilbert-Varshamov bound. The construction is based on the generalized Hermitian curve introduced by A. Bassa, P. Beelen, A. Garcia, and H. Stichtenoth. These codes are…

Information Theory · Computer Science 2015-07-14 Chuangqiang Hu

Flag codes generalize constant dimension codes by considering sequences of nested subspaces with prescribed dimensions as codewords. A comprehensive construction, which unites cyclic orbit flag codes, yields two families of flag codes on…

Information Theory · Computer Science 2026-01-14 Junfeng Jia , Yanxun Chang

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

Consider the smooth projective models C of curves y^2=f(x) with f(x) in Z[x] monic and separable of degree 2g+1. We prove that for g >= 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower…

Number Theory · Mathematics 2016-08-03 Bjorn Poonen , Michael Stoll

This study is the first part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Circulant graphs $C_n(R)$ and $C_n(S)$ are said to be \emph{Adam's isomorphic} if there exist some $a\in…

Combinatorics · Mathematics 2026-05-13 Vilfred Kamalappan

In this paper we study flag codes on $\mathbb{F}_q^n$, being $\mathbb{F}_q$ the finite field with $q$ elements. Special attention is given to the connection between the parameters and properties of a flag code and the ones of a family of…

Information Theory · Computer Science 2020-12-21 Clementa Alonso-González , Miguel Ángel Navarro-Pérez

An $\textit{identifying code}$ of a closed-twin-free graph $G$ is a set $S$ of vertices of $G$ such that any two vertices in $G$ have a distinct intersection between their closed neighborhood and $S$. It was conjectured that there exists a…

Combinatorics · Mathematics 2024-07-24 Dipayan Chakraborty , Florent Foucaud , Michael A. Henning , Tuomo Lehtilä

A subgraph $H$ of a graph $G$ is isometric if the distances between vertices in $H$ coincide with the distances between the corresponding vertices in $G$. We show that for any integer $n\ge 1$, there is a graph on $3^{n+O(\log^2 n)}$…

Combinatorics · Mathematics 2021-06-24 Louis Esperet , Cyril Gavoille , Carla Groenland

In this article we explicitly determine the structure of the Weierstrass semigroups $H(P)$ for any point $P$ of the Suzuki curve $\mathcal{S}_q$. As the point $P$ varies, exactly two possibilities arise for $H(P)$: one for the…

Combinatorics · Mathematics 2018-11-21 Daniele Bartoli , Maria Montanucci , Giovanni Zini

It has recently been shown in [\emph{Discrete Appl. Math.} {\bf 366} (2025) 75--85] that the resonance graph of a plane elementary bipartite graph $G$ is a daisy cube if and only if $G$ is peripherally 2-colorable. Let $G$ be a peripherally…

Combinatorics · Mathematics 2025-05-14 Zhongyuan Che , Zhibo Chen

In network coding, a flag code is a set of sequences of nested subspaces of $\mathbb{F}_q^n$, being $\mathbb{F}_q$ the finite field with $q$ elements. Flag codes defined as orbits of a cyclic subgroup of the general linear group acting on…

Information Theory · Computer Science 2021-02-02 Clementa Alonso-González , Miguel Ángel Navarro-Pérez

The Galois hull of a linear code is the intersection of itself and its Galois dual code, which has aroused the interest of researchers in these years. In this paper, we study Galois hulls of linear codes. Firstly, the symmetry of the…

Information Theory · Computer Science 2023-01-12 Yang Li , Shixin Zhu

The moduli space $\bar{M}_{0,n}$ of stable rational n-pointed curves has divisorial boundary with simple normal crossings. In this brief note I observe that the dual complex is a flag complex; that is, a collection of irreducible boundary…

Algebraic Geometry · Mathematics 2016-05-10 Noah Giansiracusa

We construct the homogeneous Einstein equation for generalized flag manifolds $G/K$ of a compact simple Lie group $G$ whose isotropy representation decomposes into five inequivalent irreducible $\Ad(K)$-submodules. To this end we apply a…

Differential Geometry · Mathematics 2019-11-25 Andreas Arvanitoyeorgos , Ioannis Chrysikos , Yusuke Sakane

An $\textit{isometric path}$ is a shortest path between two vertices. An $\textit{isometric path partition}$ (IPP) of a graph $G$ is a set $I$ of vertex-disjoint isometric paths in $G$ that partition the vertices of $G$. The…

Combinatorics · Mathematics 2025-05-27 Irena Penev , R. B. Sandeep , D. K. Supraja , S. Taruni
‹ Prev 1 4 5 6 7 8 10 Next ›