English
Related papers

Related papers: Relative projective group codes over chain rings

200 papers

Given a complex simply connected simple algebraic group $G$ of exceptional type and a maximal parabolic subgroup $P \subset G$, we classify all triples $(G,P,H)$ such that $H \subset G$ is a maximal reductive subgroup acting spherically on…

Representation Theory · Mathematics 2011-11-17 Bruno Niemann

In this letter we consider the ensemble of codes formed by the serial concatenation of a Hamming code and two accumulate codes. We show that this ensemble is asymptotically good, in the sense that most codes in the ensemble have minimum…

Information Theory · Computer Science 2009-05-29 Alexandre Graell i Amat , Raphael Le Bidan

Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes…

Information Theory · Computer Science 2016-02-05 Chunming Tang , Can Xiang , Keqin Feng

A group code structure of a linear code is a description of the code as one-sided or two-sided ideal of a group algebra of a finite group. In these realizations, the group algebra is identified with the ambient space, and the group elements…

Information Theory · Computer Science 2009-03-06 Jose Joaquin Bernal , Angel del Rio , Juan Jacobo Simon

We classify, in terms of the structure of the finite group G, all group algebras KG for which all right ideals are right annihilators of principal left ideals. This means in the language of coding theory that we classify code-checkable…

Information Theory · Computer Science 2021-02-09 Martino Borello , Javier de la Cruz , Wolfgang Willems

Let $p$ be an odd prime number. In this paper, we construct $2(2p-3)$ classes of codes over the ring $R=\Bbb F_p+u\Bbb F_p,u^2=0$, which are associated with down sets. We compute the Lee weight distributions of the $2(2p-3)$ classes of…

Information Theory · Computer Science 2020-01-22 Yansheng Wu , Jong Yoon Hyun

Linear sets over finite fields are central objects in finite geometry and coding theory, with deep connections to structures such as semifields, blocking sets, KM-arcs, and rank-metric codes. Among them, $i$-clubs, a class of linear sets…

Combinatorics · Mathematics 2025-08-04 Jonathan Mannaert , Paolo Santonastaso , Ferdinando Zullo

Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets. In this paper we prove an upper bound on the minimal…

Combinatorics · Mathematics 2021-05-18 Tamás Héger , Zoltán Lóránt Nagy

We study affine cartesian codes, which are a Reed-Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field F_q. These codes appeared recently in a work by H. Lopez, C.…

Information Theory · Computer Science 2013-08-27 Cicero Carvalho

Motivated by the Farrell-Jones Conjecture for group rings, we formulate the $\mathcal{C}$op-Farrell-Jones Conjecture for the K-theory of Hecke algebras of td-groups. We prove this conjecture for (closed subgroups of) reductive p-adic groups…

K-Theory and Homology · Mathematics 2023-12-22 Arthur Bartels , Wolfgang Lueck

In order to understand the performance of a code under maximum-likelihood (ML) decoding, it is crucial to know the minimal codewords. In the context of linear programming (LP) decoding, it turns out to be necessary to know the minimal…

Information Theory · Computer Science 2016-11-17 Pascal O. Vontobel , Roxana Smarandache , Negar Kiyavash , Jason Teutsch , Dejan Vukobratovic

Delsarte showed that for any projective linear code over a finite field of characteristic p with two nonzero Hamming weights w1 < w2 there exist positive integers u and s such that w1 = (p^s)u and w2 = (p^s)(u+1). Moreover, he showed that…

Combinatorics · Mathematics 2015-10-16 Eimear Byrne , Michael Kiermaier , Alison Sneyd

The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance…

Information Theory · Computer Science 2010-11-04 Olav Geil , Carlos Munuera , Diego Ruano , Fernando Torres

Batch codes serve as critical tools for load balancing in distributed storage systems. While numerous constructions exist for specific batch sizes t, current methodologies predominantly rely on code dimension parameters, limiting their…

Information Theory · Computer Science 2025-04-29 Eldho K. Thomas

Following a scheme suggested by B. Feigon, we investigate a local relative trace formula in the situation of a reductive $p$ -adic group $G$ relative to a symmetric subgroup $H= \underline{H}(F)$ where $\underline{H}$ is split over the…

Representation Theory · Mathematics 2015-07-01 Patrick Delorme , Pascale Harinck , Sofiane Souaifi

Let G be a general (not necessarily finite dimensional compact) Lie group, let g be its Lie algebra, let Cg be the cone on g in the category of differential graded Lie algebras, and consider the functor which assigns to a chain complex V…

Differential Geometry · Mathematics 2008-10-02 Johannes Huebschmann

Recently, minimal linear codes have been extensively studied due to their applications in secret sharing schemes, secure two-party computations, and so on. Constructing minimal linear codes violating the Ashikhmin-Barg condition and then…

Information Theory · Computer Science 2022-01-11 Haibo Liu , Qunying Liao

Let $X$ be a Noetherian separated scheme. Let $G$ be a reductive $X$-group scheme, and let $E$ be a principal $G$-bundle over $\mathbb{P}^1_X$. We prove that if the restriction of $E$ to $\infty\times X$ is Zariski locally trivial, then $E$…

Algebraic Geometry · Mathematics 2025-01-10 Ivan Panin , Anastasia Stavrova

We show that the pair given by the power set and by the "Grassmannian"(set of all subgroups) of an arbitrary group behaves very much like the pair given by a projective space and its dual projective space. More precisely, we generalize…

Group Theory · Mathematics 2012-01-31 Wolfgang Bertram

We construct families of commutative (super) algebra objects in the category of weight modules for the unrolled restricted quantum group $\overline{U}_q^H(\mfg)$ of a simple Lie algebra $\mfg$ at roots of unity, and study their categories…

Representation Theory · Mathematics 2020-05-27 Thomas Creutzig , Matthew Rupert