English
Related papers

Related papers: Matrix-product structure of repeated-root constacy…

200 papers

We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each…

Computational Complexity · Computer Science 2022-11-24 Amey Bhangale , Prahladh Harsha , Orr Paradise , Avishay Tal

Let $m\geq 3$ be an odd integer and $p$ be an odd prime. % with $p-1=2^rh$, where $h$ is an odd integer. In this paper, many classes of three-weight cyclic codes over $\mathbb{F}_{p}$ are presented via an examination of the condition for…

Information Theory · Computer Science 2013-08-28 Chunlei Li , Nian Li , Tor Helleseth , Cunsheng Ding

Let $\mathbb{F}_q$ be a finite field with $q$ elements and denote by $\theta : \mathbb{F}_q\to\mathbb{F}_q$ an automorphism of $\mathbb{F}_q$. In this paper, we deal with skew constacyclic codes, that is, linear codes of $\mathbb{F}_q^n$…

Information Theory · Computer Science 2018-06-11 Alexis E. Almendras Valdebenito , Andrea Luigi Tironi

Given a matrix over a skew field fixing the column (1,...,1)^t, we give formulas for a row vector fixed by this matrix. The same techniques are applied to give noncommutative extensions of probabilistic properties of codes.

Rings and Algebras · Mathematics 2008-09-01 Sylvain Lavallée , Christophe Reutenauer , Vladimir Retakh , Dominique Perrin

Many kinds of codes which possess two cycle structures over two special finite commutative chain rings, such as ${\Bbb Z}_2{\Bbb Z}_4$-additive cyclic codes and quasi-cyclic codes of fractional index etc., were proved asymptotically good.…

Information Theory · Computer Science 2022-03-11 Yun Fan , Hualu Liu

Let $P,Q\in\Bbb Z$, $U_0=0,\ U_1=1$ and $U_{n+1}=PU_n-QU_{n+1}$. In this paper we obtain a general congruence for $U_{kmn^r}/U_k\pmod {n^{r+1}}$, where $k,m,n,r$ are positive integers. As applications we extend Lucas' law of repetition and…

Number Theory · Mathematics 2013-12-13 Zhi-Hong Sun

A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…

Information Theory · Computer Science 2025-12-03 Cristina Fernández-Córdoba , Sergi Sánchez-Aragón , Mercè Villanueva

Let $p$ be an odd prime. In this paper we investigate quadratic residues modulo $p$ and related permutations, congruences and identities. If $a_1<\ldots<a_{(p-1)/2}$ are all the quadratic residues modulo $p$ among $1,\ldots,p-1$, then the…

Number Theory · Mathematics 2019-07-10 Zhi-Wei Sun

In this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}=\mathbb{Z}_{p}[u]/\left( f\left(u\right) /\left( u-s\right) \right)$, where $p$ is a prime number and $f\left( u\right) =u^{p}-u$, with $s\in…

Information Theory · Computer Science 2026-05-28 Cristina Flaut , Bianca Liana Bercea-Straton

By a very simple argument, we prove that if $l,m,n$ are nonnegative integers then $$\sum_{k=0}^l(-1)^{m-k}\binom{l}{k}\binom{m-k}{n}\binom{2k}{k-2l+m} =\sum_{k=0}^l\binom{l}{k}\binom{2k}{n}\binom{n-l}{m+n-3k-l}. On the basis of this…

Combinatorics · Mathematics 2007-05-23 Hao Pan , Zhi-Wei Sun

Let $\mathrm{SLAut}(\mathbb{F}_{q}^{n})$ denote the group of all semilinear isometries on $\mathbb{F}_{q}^{n}$, where $q=p^{e}$ is a prime power. Matrix-product (MP) codes are a class of long classical codes generated by combining several…

Information Theory · Computer Science 2024-05-14 Meng Cao

Let q be a prime power and F_q be a finite field. In this paper, we study constacyclic codes over the ring F_q+ u F_q +v F_q+ u v F_q, where u^2=u, v^2=v and uv=vu. We characterized the generator polynomials of constacyclic codes and their…

Information Theory · Computer Science 2016-05-03 Joël Kaboré , Mohammed E. Charkani

Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good…

Information Theory · Computer Science 2020-12-08 Pavel Pudlák

For any positive integer $m$ and an odd prime $p$; let $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $q=p^{m}$, be a ring extension of the ring $\mathbb{F}_{p}+u\mathbb{F}_{p}.$ In this paper, we construct linear codes over…

Information Theory · Computer Science 2024-06-27 Pavan Kumar , Noor Mohammad Khan

Let $\mathbb{F}_{2^m}$ be a finite field of $2^m$ elements, and $R=\mathbb{F}_{2^m}[u]/\langle u^k\rangle=\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}+\ldots+u^{k-1}\mathbb{F}_{2^m}$ ($u^k=0$) where $k$ is an integer satisfying $k\geq 2$. For any odd…

Information Theory · Computer Science 2019-10-08 Yonglin Cao , Yuan Cao , Fang-Wei Fu

We prove that the Lie algebra $\mathfrak{sl}_n(\textbf{F}_q)$ of traceless matrices over a finite field of characteristic $p$ can be generated by $2$ elements with exceptions when $(n, p)$ is $(3, 3)$ or $(4,2)$. In the latter cases, we…

Rings and Algebras · Mathematics 2025-02-25 Omer Cantor , Urban Jezernik , Andoni Zozaya

We generalize the construction of Narain conformal field theories (CFTs) from qudit stabilizer codes to the construction from quantum stabilizer codes over the finite field of prime power order ($\mathbb{F}_{p^m}$ with $p$ prime and $m\geq…

High Energy Physics - Theory · Physics 2023-11-28 Yasin Ferdous Alam , Kohki Kawabata , Tatsuma Nishioka , Takuya Okuda , Shinichiro Yahagi

We show that an irreducible polynomial $p$ with no zeros on the closure of a matrix unit polyball, a.k.a. a cartesian product of Cartan domains of type I, and such that $p(0)=1$, admits a strictly contractive determinantal representation,…

Functional Analysis · Mathematics 2015-03-23 Anatolii Grinshpan , Dmitry S. Kaliuzhnyi-Verbovetskyi , Victor Vinnikov , Hugo J. Woerdeman

Let $(Q,\mathfrak{n})$ be a regular local ring of dimension $c \geq 2$ with algebraically closed residue field $k = Q/\mathfrak{n}$. Let $f_1, f_2, \ldots f_{c-1}, g$ be a regular sequence in $Q$ such that $ f_i \in \mathfrak{n}^2$ for all…

Commutative Algebra · Mathematics 2025-06-13 Tony J. Puthenpurakal

We give several families of reasonably small integers $k, \ell \ge 1$ and real positive $\alpha, \beta \le 1$, such that the products $p_1\ldots p_k s$, where $p_1, \ldots, p_k \le m^\alpha$ are primes and $s \le m^\beta$ is a product of at…

Number Theory · Mathematics 2017-05-18 Igor E. Shparlinski