中文
相关论文

相关论文: On polycyclic codes over a finite chain ring

200 篇论文

Let $R$ be a finite commutative chain ring with unique maximal ideal $\langle \gamma\rangle$, and let $n$ be a positive integer coprime with the characteristic of $R/\langle \gamma\rangle$. In this paper, the algebraic structure of cyclic…

信息论 · 计算机科学 2014-05-13 Bocong Chen , San Ling , Guanghui Zhang

In this article, we study skew cyclic codes over ring $R=\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$, where $q=p^{m}$, $p$ is an odd prime and $v^{3}=v$. We describe generator polynomials of skew cyclic codes over this ring and…

信息论 · 计算机科学 2017-01-05 Minjia Shi , Ting Yao , Adel Alahmadi , Patrick Solé

A classic result of Delsarte connects the strength (as orthogonal array) of a linear code with the minimum weight of its dual: the former is one less than the latter. We show that Delsarte's observation extends to codes over arbitrary…

组合数学 · 数学 2019-05-31 Peter J. Cameron , Josephine Kusuma , Patrick Solé

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

数论 · 数学 2018-07-09 Fusun Akman

In this paper, we mainly study the theory of linear codes over the ring $R =\mathbb{Z}_4+u\mathbb{Z}_4+v\mathbb{Z}_4+uv\mathbb{Z}_4$. By the Chinese Remainder Theorem, we have $R$ is isomorphic to the direct sum of four rings…

信息论 · 计算机科学 2016-01-19 Ping Li , Xuemei Guo , Shixin Zhu

We construct two series of linear codes over finite ring $\mathbb{F}_{q}[x]/(x^2)$ and Galois ring $GR(p^2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}_{q}$ by Gray map. The…

信息论 · 计算机科学 2016-12-06 Jin Li , Aixian Zhang , Keqin Feng

We present a theory for splitting algebras of monic polynomials over rings, and apply the results to symmetric functions, and Galois theory. Our main result is that the ring of invariants of a splitting algebra under the symmetric group…

交换代数 · 数学 2007-05-23 Torsten Ekedahl , Dan Laksov

This paper provides the Generalized Mattson Solomon polynomial for repeated-root polycyclic codes over local rings that gives an explicit decomposition of them in terms of idempotents that completes the single root study. It also states…

信息论 · 计算机科学 2024-11-28 Maryam Bajalan , Edgar Martinez-Moro , Reza Sobhani , Steve Szabo , Gulsum Gozde Yilmazguc

In this paper we study the structure of $\theta$-cyclic codes over the ring $B_k$ including its connection to quasi-$\tilde{\theta}$-cyclic codes over finite field $\mathbb{F}_{p^r}$ and skew polynomial rings over $B_k.$ We also…

In this article, for the finite field $\mathbb{F}_q$, we show that the $\mathbb{F}_q$-algebra $\mathbb{F}_q[x]/\langle f(x) \rangle$ is isomorphic to the product ring $\mathbb{F}_q^{\deg f(x)}$ if and only if $f(x)$ splits over…

信息论 · 计算机科学 2025-02-10 Akanksha , Ritumoni Sarma

In this paper the relationship between $S$-subgroups in $\Z_{2}^{n}$ and binary codes is shown. If the codes used are both $P(T)$-codes and $G$-codes, then the $S$-subgroup is free. The codes constructed are cyclic, decimated or symmetric…

组合数学 · 数学 2019-06-12 Ronald Orozco López

Let $A=\frac{\mathbb{F}[x]}{\langle f(x)\rangle }$, where $f(x)$ is a monic polynomial over a finite field $\mathbb{F}$. In this paper, we study the relation between $A$-codes and their duals. In particular, we state a counterexample and a…

信息论 · 计算机科学 2017-05-30 Ashkan Nikseresht

A Schur ring (S-ring) over a group $G$ is called separable if every of its similaritities is induced by isomorphism. We establish a criterion for an S-ring to be separable in the case when the group $G$ is cyclic. Using this criterion, we…

群论 · 数学 2017-06-21 Sergei Evdokimov , Ilya Ponomarenko

In this paper, a transform approach is used for polycyclic and serial codes over finite local rings in the case that the defining polynomials have no multiple roots. This allows us to study them in terms of linear algebra and invariant…

信息论 · 计算机科学 2024-11-11 Maryam Bajalan , Edgar Martínez-Moro , Steve Szabo

The monomial codes over a Galois field F_q that can be thought invariant subspaces are essential to us in this study. More specifically, we look into the link between monomial codes and characteristic subspaces and the decomposition of…

信息论 · 计算机科学 2023-04-04 El Mahdi Mouloua , Mustapha Najmeddine , Maria Isabel Garcia-Planas , Hassan Ouazzou

Let $p$ be a prime number. Irreducible cyclic codes of length $p^2-1$ and dimension $2$ over the integers modulo $p^h$ are shown to have exactly two nonzero Hamming weights. The construction uses the Galois ring of characteristic $p^h$ and…

信息论 · 计算机科学 2019-11-19 Minjia Shi , Tor Helleseth , Patrick Sole

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…

信息论 · 计算机科学 2015-05-01 A. Melakheso , K. Guenda

We investigate linear codes over the ring $\mathbb{Z}_4 + u\mathbb{Z}_4 + v\mathbb{Z}_4 + w\mathbb{Z}_4 + uv\mathbb{Z}_4 + uw\mathbb{Z}_4 + vw\mathbb{Z}_4 + uvw\mathbb{Z}_4$, with conditions $u^2=u$, $v^2=v$, $w^2=w$, $uv=vu$, $uw=wu$ and…

信息论 · 计算机科学 2019-04-26 Bustomi , Aditya Purwa Santika , Djoko Suprijanto

Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…

信息论 · 计算机科学 2017-02-02 Cem Güneri , Ferruh Özbudak , Buket Özkaya , Elif Saçıkara , Zahra Sepasdar , Patrick Solé

We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…

信息论 · 计算机科学 2017-09-19 E. Martínez-Moro , A. Piñera-Nicolás , I. F. Rúa