English
Related papers

Related papers: Some Algebraic Questions about the Reed-Muller Cod…

200 papers

Godel numbering is an arithmetization of sintax which defines provability by coding a primitive recursive predicate, Pf(x,v). A multiplicity of researches and results all around this well-known recursive predicate are today widespread in…

Logic in Computer Science · Computer Science 2024-04-08 Paola Cattabriga

Affine Grassmann codes are a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. These codes were introduced in a recent work [2]. Here we consider, more generally, affine Grassmann codes of a given level.…

Information Theory · Computer Science 2012-06-07 Peter Beelen , Sudhir R. Ghorpade , Tom Hoeholdt

Let $\mathbb{F}_q$ be a finite field with $q=p^{e}$ elements, where $p$ is a prime number and $e \geq 1$ is an integer. In this paper, by means of generalized Reed-Solomon (GRS) codes, we construct two new classes of quantum…

Information Theory · Computer Science 2020-02-17 Hualu Liu , Xiusheng Liu

A certain class of unitary representations of U_q(sl(2,R)) has the property of being simultanenously a representation of U_{tilde{q}}(sl(2,R)) for a particular choice of tilde{q}(q). Faddeev has proposed to unify the quantum groups…

Quantum Algebra · Mathematics 2009-11-07 A. Bytsko , J. Teschner

We compute the dimension $d_{n,r}(q) = \dim(\IR_q^r)$ of the defining module $\IR_q^r$ for the $q$-partition algebra. This module comes from $r$-iterations of Harish-Chandra restriction and induction on $\GL_n(\FF_q)$. This dimension is a…

Combinatorics · Mathematics 2009-09-08 Tom Halverson , Nathaniel Thiem

Let $\mathbb{F}_q$ be a finite field of $q$ elements, for some prime power $q$, and let $G$ be a finite group. A (left) group code, or simply a $G$-code, is a (left) ideal of the group algebra $\mathbb{F}_q[G]$. In this paper, we provide a…

Information Theory · Computer Science 2026-02-05 Miguel Sales-Cabrera , Xaro Soler-Escrivà , Víctor Sotomayor

In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and…

Information Theory · Computer Science 2017-04-13 A. Melakhessou , K. Guenda , T. A. Gulliver , M. Shi , P. Solé

This paper presents a set of quantum Reed-Muller codes which are typically 100 times more effective than existing quantum Reed-Muller codes.

Quantum Physics · Physics 2007-05-23 Lin Zhang , Ian Fuss

For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $\varphi(q)$ reduced…

Number Theory · Mathematics 2019-08-21 David Wu

Let $\F$ be a non-Archimedean locally compact field, $q$ be the cardinality of its residue field, and $\R$ be an algebraically closed field of characteristic $\ell$ not dividing $q$.We classify all irredu\-cible smooth $\R$-representations…

Representation Theory · Mathematics 2015-07-21 Vincent Sécherre , C. G. Venketasubramanian

We show that every self-orthogonal code over $\mathbb F_q$ of length $n$ can be extended to a self-dual code, if there exists self-dual codes of length $n$. Using a family of Galois towers of algebraic function fields we show that over any…

Information Theory · Computer Science 2017-09-22 Alp Bassa , Henning Stichtenoth

We determine when the irreducible modules $L(c_{p, q}, h_{m, n})$ over the simple Virasoro vertex algebras $\operatorname{Vir}_{p, q}$, where $p, q \ge 2$ are relatively prime with $0 < m < p$ and $0 < n < q$, are classically free. It turns…

Quantum Algebra · Mathematics 2026-04-28 Diego Salazar

A monic polynomial in F_q[t] of degree n over a finite field F_q of odd characteristic can be written as the sum of two irreducible monic elements in F_q[t] of degrees n and n-1 if q is larger than a bound depending only on n. The main tool…

Number Theory · Mathematics 2014-01-14 Andreas O. Bender

Recently, Bhaintwal and Wasan studied the Generalized Reed-Muller codes over the prime power integer residue ring. In this paper, we give a generalization of these codes to Generalized Reed-Muller codes over Galois rings.

Information Theory · Computer Science 2018-01-17 Harinaivo Andriatahiny , Desiré Arsène Ratahirinjatovo , Sanni José Andrianalisefa

MDS codes and self-dual codes are important families of classical codes in coding theory. It is of interest to investigate MDS self-dual codes. The existence of MDS self-dual codes over finite field $F_q$ is completely solved for $q$ is…

Information Theory · Computer Science 2022-08-30 Ruhao Wan , Shixin Zhu , Jin Li

Let $n$ be a prime power, $r$ be a prime with $r\mid n-1$, and $\varepsilon\in (0,1/2)$. Using the theory of multiplicative character sums and superelliptic curves, we construct new codes over $\mathbb F_r$ having length $n$, relative…

Information Theory · Computer Science 2024-09-18 Giacomo Cherubini , Giacomo Micheli

Let G be a linear Lie group. We define the G-reducibility of a continuous or discrete cocycle modulo N. We show that a G-valued continuous or discrete cocycle which is GL(n,C)-reducible is in fact G-reducible modulo 2 if…

Dynamical Systems · Mathematics 2008-10-06 Claire Chavaudret

For a prime $p,$ let $\mathbb{F}_q$ be a finite extension of $\mathbb{F}_p.$ The restriction of an irreducible mod $p$ representation of $\text{GL}_2(\mathbb{F}_q)$ to its subgroup $\text{GL}_2(\mathbb{F}_p)$ can be seen as a tensor product…

Representation Theory · Mathematics 2025-07-29 Shubhanshi Gupta

Basic modules of McLain groups $M=M(\Lambda,\leq, R)$ are defined and investigated. These are (possibly infinite dimensional) analogues of Andr\'e's supercharacters of $U_n(q)$. The ring $R$ need not be finite or commutative and the field…

Representation Theory · Mathematics 2016-11-01 Fernando Szechtman , Allen Herman , Mohammad Izadi

Binary Reed-Muller (RM) codes are defined via evaluations of Boolean-valued functions on $\mathbb{Z}_2^m$. We introduce a class of binary linear codes that generalizes the RM family by replacing the domain $\mathbb{Z}_2^m$ with an arbitrary…

Information Theory · Computer Science 2026-02-17 Nolan J. Coble , Alexander Barg