English
Related papers

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

200 papers

Let $q$ be a power of a prime $p$. In this paper, we study reversible cyclic codes of arbitrary length over the ring $ R = \mathbb{F}_q + u \mathbb{F}_q$, where $u^2=0 mod q$. First, we find a unique set of generators for cyclic codes over…

Information Theory · Computer Science 2019-10-16 Om Prakash , Shikha Patel , Shikha Yadav

Let $U_q(\hat{sl}_2)^{\geq 0}$ denote the Borel subalgebra of the quantum affine algebra $U_q(\hat{sl}_2)$. We show that the following hold for any choice of scalars $\epsilon_0, \epsilon_1$ from the set ${1,-1}$. (i) Let $V$ be a…

Quantum Algebra · Mathematics 2007-05-23 Georgia Benkart , Paul Terwilliger

For a nonnegative integer $r$ and a positive integer $v$ satisfying \[ \frac{r(q-1)}{2}<v<\frac{(r+1)(q-1)}{2}, \] we define the combinatorial numbers \[ A_r(v)= \begin{cases} \displaystyle \sum_{t=r(q-1)-v}^{v}\…

Information Theory · Computer Science 2026-04-24 Yufeng Song , Qin Yue

First we study some properties of the modular group algebra $\mathbb{F}_{p^r}[G]$ where $G$ is the additive group of a Galois ring of characteristic $p^r$ and $\mathbb{F}_{p^r}$ is the field of $p^r$ elements. Secondly a description of the…

Information Theory · Computer Science 2016-10-03 Harinaivo Andriatahiny , Vololona Harinoro Rakotomalala

In this paper, we consider the Reed-Muller (RM) codes. For the first order RM code, we prove that it is unique in the sense that any linear code with the same length, dimension and minimum distance must be the first order RM code; For the…

Information Theory · Computer Science 2009-04-30 Yanling Chen , Han Vinck

Let $\Bbb F_q$ be a finite field with $q$ elements. Let $n$ be a positive integer with radical $rad(n)$, namely, the product of distinct prime divisors of $n$. If the order of $q$ modulo $rad(n)$ is either 1 or a prime, then the irreducible…

Information Theory · Computer Science 2020-12-16 Yansheng Wu , Qin Yue

A linear code is called an MDS self-dual code if it is both an MDS code and a self-dual code with respect to the Euclidean inner product. The parameters of such codes are completely determined by the code length. In this paper, we consider…

Information Theory · Computer Science 2020-05-26 Weijun Fang , Jun Zhang , Shu-Tao Xia1 , Fang-Wei Fu

The mds (maximum distance separable) conjecture claims that a nontrivial linear mds $[n,k]$ code over the finite field $GF(q)$ satisfies $n \leq (q + 1)$, except when $q$ is even and $k = 3$ or $k = q- 1$ in which case it satisfies $n \leq…

Information Theory · Computer Science 2019-03-14 Ted Hurley

Let $q$ be a prime power. This paper provides a new class of linear codes that arises from the action of the alternating group on $\mathbb F_q[x_1,\dots,x_m]$ combined with the ideas in (M. Datta and T. Johnsen, 2022). Compared with…

Information Theory · Computer Science 2024-12-17 Giacomo Micheli , Vincenzo Pallozzi Lavorante , Phillip Waitkevich

We describe a correspondence (or duality) between the q-characters of finite-dimensional representations of a quantum affine algebra and its Langlands dual in the spirit of q-alg/9708006 and 0809.4453. We prove this duality for the…

Quantum Algebra · Mathematics 2011-04-20 Edward Frenkel , David Hernandez

We define an exact functor $F_{n,k}$ from the category of Harish-Chandra modules for $GL(n,R)$ to the category of finite-dimensional representations for the degenerate affine Hecke algebra for $gl(k)$. Under certain natural hypotheses, we…

Representation Theory · Mathematics 2009-03-06 Dan Ciubotaru , Peter E. Trapa

Self-dual codes over finite fields and over some finite rings have been of interest and extensively studied due to their nice algebraic structures and wide applications. Recently, characterization and enumeration of Euclidean self-dual…

Information Theory · Computer Science 2019-09-10 Parinyawat Choosuwan , Somphong Jitman

Maximum Distance Separable (MDS) self-dual codes are of significant theoretical and practical importance. Generalized Reed-Solomon (GRS) codes are the most prominent MDS codes. Correspondingly there have been many research on constructions…

Information Theory · Computer Science 2026-02-09 Chun'e Zhao , Wenping Ma

The Reed-Muller (RM) code encoding $n$-variate degree-$d$ polynomials over ${\mathbb F}_q$ for $d < q$, with its evaluation on ${\mathbb F}_q^n$, has relative distance $1-d/q$ and can be list decoded from a $1-O(\sqrt{d/q})$ fraction of…

Information Theory · Computer Science 2017-04-04 Venkatesan Guruswami , Lingfei Jin , Chaoping Xing

We classify all irreducible highest-weight unitary modules over the non-compact real form $\mathfrak{u}(p,q|n)$ of the general linear Lie superalgebra $\mathfrak{gl}_{p+q|n}$. The classification is given by explicit necessary and sufficient…

Representation Theory · Mathematics 2026-04-28 Mark D. Gould , Artem Pulemotov , Jorgen Rasmussen , Yang Zhang

In this paper, a q-analogue of r-Whitney-Lah numbers, also known as (q,r)-Whitney-Lah number, denoted by $L_{m,r}[n,k]_q$ is defined using the triangular recurrence relation. Several fundamental properties for the q-analogue are established…

Combinatorics · Mathematics 2020-12-15 Roberto B. Corcino , Jay M. Ontolan , Maria Rowena S. Lobrigas

We prove that there is a Hermitian self-orthogonal $k$-dimensional truncated generalised Reed-Solomon code of length $n \leqslant q^2$ over ${\mathbb F}_{q^2}$ if and only if there is a polynomial $g \in {\mathbb F}_{q^2}$ of degree at most…

Information Theory · Computer Science 2021-12-24 Simeon Ball , Ricard Vilar

A set of quantum error correcting codes based on classical Reed-Muller codes is described. The codes have parameters [[n,k,d]] = [[2^r, 2^r - C(r,t) - 2 sum_{i=0}^{t-1} C(r,i), 2^t + 2^{t-1} ]].

Quantum Physics · Physics 2008-02-03 Andrew Steane

We establish a new Howe duality between a pair of two queer Lie superalgebras (q(m),q(n)). This gives a representation theoretic interpretation of a well-known combinatorial identity for Schur Q-functions. We further establish the…

Representation Theory · Mathematics 2007-05-23 Shun-Jen Cheng , Weiqiang Wang

We study generalized Fibonacci sequences $F_{n+1}=PF_n-QF_{n-1}$ with initial values $F_0=0$ and $F_1=1$. Let $P,Q$ be nonzero integers such that $P^2-4Q$ is not a perfect square. We show that if $Q=\pm 1$ then the sequence…

Number Theory · Mathematics 2020-02-26 Mohammad Javaheri , Nikolai Krylov