English
Related papers

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

200 papers

Split group codes are a class of group algebra codes over an abelian group. They were introduced in 2000 by Ding, Kohel and Ling as a generalization of the cyclic duadic codes. For a prime power q and an abelian group G of order n such that…

Rings and Algebras · Mathematics 2007-05-23 Lilibeth Dicuangco , Pieter Moree , Patrick Sole

Recently, Alanazi, Munagi, and Saikia employed the theory of modular forms to investigate the arithmetic properties of the function $\overline{R_{\ell,\mu}}(n)$, which enumerates the overpartitions of $n$ where no part is divisible by…

Number Theory · Mathematics 2025-05-29 Bishnu Paudel , James A. Sellers , Haiyang Wang

In this paper, we study the third weight of generalized Reed-Muller codes. We prove under some restrictive condition that the third weight of generalized Reed-Muller codes depends on the third weight of generalized Reed-Muller codes of…

Information Theory · Computer Science 2014-01-22 Elodie Leducq

We identify a family of binary codes whose structure is similar to Reed-Muller (RM) codes and which include RM codes as a strict subclass. The codes in this family are denoted as $C_n(r,m)$, and their duals are denoted as $B_n(r,m)$. The…

Information Theory · Computer Science 2023-07-26 Lakshmi Prasad Natarajan , Prasad Krishnan

Let $m$, $n$ be two positive integers, $\Bbbk$ be an algebraically closed field with char($\Bbbk)\nmid mn$. Radford constructed an $mn^{2}$-dimensional Hopf algebra $R_{mn}(q)$ such that its Jacobson radical is not a Hopf ideal. We show…

Quantum Algebra · Mathematics 2024-08-20 Hua Sun , Yuyan Zhang , Libin Li

In this paper, we propose a new method for constructing $1$-perfect mixed codes in the Cartesian product $\mathbb{F}_{n} \times \mathbb{F}_{q}^n$, where $\mathbb{F}_{n}$ and $\mathbb{F}_{q}$ are finite fields of orders $n = q^m$ and $q$. We…

Information Theory · Computer Science 2023-12-27 Alexander M. Romanov

A linear code $C$ over $\mathbb{F}_q$ is called $\Delta$-divisible if the Hamming weights $\operatorname{wt}(c)$ of all codewords $c \in C$ are divisible by $\Delta$. The possible effective lengths of $q^r$-divisible codes have been…

Combinatorics · Mathematics 2025-02-19 Sascha Kurz

The quantum group SL_q(2,R) at roots of unity is introduced by means of duality pairings with the quantum algebra U_q(sl(2,R)). Its irreducible representations are constructed through the universal T-matrix. An invariant integral on this…

Quantum Algebra · Mathematics 2009-10-31 H. Ahmedov , O. F. Dayi

Let q>1 and m>0 be relatively prime integers. We find an explicit period $\nu_m(q)$ such that for any integers n>0 and r we have $[n+\nu_m(q),r]_m(a)=[n,r]_m(a) (mod q)$ whenever a is an integer with $\gcd(1-(-a)^m,q)=1$, or a=-1 (mod q),…

Number Theory · Mathematics 2007-08-06 Zhi-Wei Sun , Roberto Tauraso

For a subgroup of $PGL(2,q)$ we show how some irreducible polynomials over $\mathbb{F}_q$ arise from the field of invariant rational functions. The proofs rely on two actions of $PGL(2,F)$, one on the projective line over a field $F$ and…

Number Theory · Mathematics 2021-08-27 Rod Gow , Gary McGuire

We provide a comprehensive overview of the fundamental structural properties of weighted projective Reed-Muller codes. We give a recursive construction for these codes, under some conditions for the weights, and we use it to derive bounds…

Information Theory · Computer Science 2026-03-26 Jade Nardi , Rodrigo San-José

Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to…

Information Theory · Computer Science 2017-03-17 Ilya Dumer

In this paper, we study the linear codes over the commutative ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$ and their Gray images, where $v^{3}=v$. We define the Lee weight of the elements of $R$, we give a Gray map from $R^{n}$ to $\F^{3n}_{q}$ and…

Information Theory · Computer Science 2015-05-01 A. Melakheso , K. Guenda

In this paper, the divisibility property of the type 2 $(p, q)$-analogue of the $r$-Whitney numbers of the second kind is established. More precisely, a congruence relation modulo $pq$ for this $(p,q)$-analogue is derived.

Combinatorics · Mathematics 2022-08-10 Roberto B. Corcino , Cristina B. Corcino

In this paper, we resolve a conjecture of Green and Liebeck [Disc. Math., 343 (8):117119, 2019] on codes in $PGL(2,q)$. To be specific, we show that: if $D$ is a dihedral subgroup of order $2(q+1)$ in $G=PGL(2,q)$, and $A=\{g\in G: g^{q+1}=…

Combinatorics · Mathematics 2020-09-03 Tao Feng , Weicong Li , Jingkun Zhou

Explicit bases for the subfield subcodes of projective Reed-Muller codes over the projective plane and their duals are obtained. In particular, we provide a formula for the dimension of these codes. For the general case over the projective…

Information Theory · Computer Science 2024-01-01 Philippe Gimenez , Diego Ruano , Rodrigo San-José

The performance of Reed--Solomon codes (RS codes, for short) in the presence of insertion and deletion errors has attracted growing attention in recent literature. In this work, we further study this intriguing mathematical problem,…

Information Theory · Computer Science 2025-09-09 Peter Beelen , Roni Con , Anina Gruica , Maria Montanucci , Eitan Yaakobi

Let $\mathbb F$ denote an algebraically closed field and assume that $q\in \mathbb F$ is a primitive $d^{\rm \, th}$ root of unity with $d\not=1,2,4$. The universal Askey--Wilson algebra $\triangle_q$ is a unital associative $\mathbb…

Representation Theory · Mathematics 2020-12-29 Hau-Wen Huang

In this paper, we study a special kind of factorization of $x^n+1$ over $\mathbb{F}_q, $ with $q$ a prime power $\equiv 3~({\rm mod}~4)$ when $n=2p,$ with $p\equiv 3~({\rm mod}~4)$ and $p$ is a prime. Given such a $q$ infinitely many such…

Information Theory · Computer Science 2018-09-11 Minjia Shi , Qian Liqin , Patrick Sole

In this paper, we study a class of subcodes of codimension $1$ in the $[n,k+1]_q$ generalized Reed-Solomon (GRS) codes, whose generator matrix is derived by removing the row of degree $k-r$ from the generator matrix of the $[n,k+1]_q$ GRS…

Information Theory · Computer Science 2025-07-08 Yu Ning
‹ Prev 1 4 5 6 7 8 10 Next ›