English
Related papers

Related papers: Affine Hermitian Grassmann Codes

200 papers

Let G be a simply-connected simple compact Lie group over the complex numbers. The affine Grassmannian is a projective ind-variety, homotopy-equivalent to the loop space of G and closely analogous to a maximal flag variety of the classical…

Algebraic Geometry · Mathematics 2007-12-19 Sara C. Billey , Stephen A. Mitchell

We study the relation between quantum affine algebras of type A and Grassmannian cluster algebras. Hernandez and Leclerc described an isomorphism from the Grothendieck ring of a certain subcategory $\mathcal{C}_{\ell}$ of…

Representation Theory · Mathematics 2019-09-27 Wen Chang , Bing Duan , Chris Fraser , Jian-Rong Li

For Kummer extensions defined by $y^m = f (x)$, where $f (x)$ is a separable polynomial over the finite field $\mathbb{F}_q$, we compute the number of Weierstrass gaps at two totally ramified places. For many totally ramified places we give…

Algebraic Geometry · Mathematics 2016-11-11 Daniele Bartoli , Luciane Quoos , Giovanni Zini

This paper is concerned with the construction of algebraic geometric codes defined from GGS curves. It is of significant use to describe bases for the Riemann-Roch spaces associated with totally ramified places, which enables us to study…

Information Theory · Computer Science 2019-02-25 Chuangqiang Hu , Shudi Yang

Polar codes were introduced by Arikan in 2008 and are the first family of error-correcting codes achieving the symmetric capacity of an arbitrary binary-input discrete memoryless channel under low complexity encoding and using an efficient…

Information Theory · Computer Science 2013-11-11 Abdulla Eid , Iwan Duursma

We show that a von Neumann algebra is finite if and only if its Grassmannians are small in a certain sense related to the atlas of affine coordinates.

Operator Algebras · Mathematics 2012-10-30 Julien Giol

This article surveys the development of the theory of algebraic geometry codes since their discovery in the late 70's. We summarize the major results on various problems such as: asymptotic parameters, improved estimates on the minimum…

Information Theory · Computer Science 2020-09-04 Alain Couvreur , Hugues Randriambololona

In this paper, we define Abelian and consta-Abelian polyadic codes over rings defined as affine algebras over chain rings. For that aim, we use the classical construction via splittings and multipliers of the underlying Abelian group. We…

Information Theory · Computer Science 2023-01-02 Gülsüm Gözde Yılmazgüç , Javier de la Cruz , Edgar Martínez-Moro

We study the geometry of flag manifolds under different embeddings into a product of Grassmannians. We show that differential geometric objects and operations -- tangent vector, metric, normal vector, exponential map, geodesic, parallel…

Optimization and Control · Mathematics 2022-12-02 Zehua Lai , Lek-Heng Lim , Ke Ye

We introduce \emph{hierarchical depth}, a new invariant of line bundles and divisors, defined via maximal chains of effective sub-line bundles. This notion gives rise to \emph{hierarchical filtrations}, refining the structure of the Picard…

Algebraic Geometry · Mathematics 2025-10-29 Rahim Rahmati-asghar

We investigate special points on the Grassmannian which correspond to friezes with coefficients in the case of rank two. Using representations of arithmetic matroids we obtain a theorem on subpolygons of specializations of the coordinate…

Combinatorics · Mathematics 2022-07-20 Michael Cuntz

Polar codes are recursive general concatenated codes. This property motivates a recursive formalization of the known decoding algorithms: Successive Cancellation, Successive Cancellation with Lists and Belief Propagation. Using such…

Information Theory · Computer Science 2015-06-19 Noam Presman , Simon Litsyn

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

Mathematical Physics · Physics 2023-07-20 Danilo Latini , Ian Marquette , Yao-Zhong Zhang

In this paper, we consider point sets of finite Desarguesian planes whose multisets of intersection numbers with lines is the same for all but one exceptional parallel class of lines. We call such sets regular of affine type. When the lines…

Combinatorics · Mathematics 2024-01-08 Angela Aguglia , Bence Csajbók , Luca Giuzzi

We consider a certain class of Schubert varieties of the affine Grassmannian of type A. By embedding a Schubert variety into a finite-dimensional Grassmannian, we construct an explicit basis of sections of the basic line bundle by…

Algebraic Geometry · Mathematics 2007-05-23 V. Kreiman , V. Lakshmibai , P. Magyar , J. Weyman

Let G be a reductive algebraic group and H a closed subgroup of G. An affine embedding of the homogeneous space G/H is an affine G-variety with an open G-orbit isomorphic to G/H. We start with some basic properties of affine embeddings and…

Algebraic Geometry · Mathematics 2009-08-22 Ivan V. Arzhantsev

The affine Hilbert function is a classical algebraic object that has been central, among other tools, to the development of the polynomial method in combinatorics. Owing to its concrete connections with Gr\"obner basis theory, as well as…

Combinatorics · Mathematics 2021-11-16 S. Venkitesh

Two families of complementary codes over finite fields $\mathbb{F}_q$ are studied, where $q=r^2$ is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and…

Information Theory · Computer Science 2017-10-13 Kriangkrai Boonniyom , Somphong Jitman

Consider the point line-geometry ${\mathcal P}_t(n,k)$ having as points all the $[n,k]$-linear codes having minimum dual distance at least $t+1$ and where two points $X$ and $Y$ are collinear whenever $X\cap Y$ is a $[n,k-1]$-linear code…

Combinatorics · Mathematics 2023-12-07 I. Cardinali , L. Giuzzi

We analyze polarization-adjusted convolutional codes using the algebraic representation of polar and Reed-Muller codes. We define a large class of codes, called generalized polynomial polar codes which include PAC codes and Reverse PAC…

Information Theory · Computer Science 2026-01-16 Vlad-Florin Dragoi , Mohammad Rowshan
‹ Prev 1 8 9 10 Next ›