English
Related papers

Related papers: Dual skew codes from annihilators: Transpose Hammi…

200 papers

An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…

Information Theory · Computer Science 2009-08-07 H. Gluesing-Luerssen , U. Helmke , J. I. Iglesias Curto

Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(x^n-1), where F is a finite field. If this automorphism itself has certain specific cyclicity properties one is lead to the class of…

Rings and Algebras · Mathematics 2007-07-16 Heide Gluesing-Luerssen , Wiland Schmale

We construct trace codes over $\Z_4$ by using Boolean functions and skew sets, respectively. Their Lee weight distribution is studied by using a Galois ring version of the Walsh-Hadamard transform and exponential sums. We obtain a new…

Information Theory · Computer Science 2017-07-04 Minjia Shi , Yan Liu , Randriam Hugues , Lin Sok , Patrick Sole

In this paper, we study Euclidean and Hermitian hulls of generalized Reed-Solomon codes and twisted generalized Reed-Solomon codes, as well as the Hermitian hulls of Roth-Lempel typed codes. We present explicit constructions of MDS and AMDS…

Information Theory · Computer Science 2022-07-19 Lin Sok

Most design approaches for trellis-coded quantization take advantage of the duality of trellis-coded quantization with trellis-coded modulation, and use the same empirically-found convolutional codes to label the trellis branches. This…

Information Theory · Computer Science 2007-12-20 Lorenzo Cappellari

In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…

Number Theory · Mathematics 2012-12-17 Xavier Caruso , Jérémy Le Borgne

We design a non-commutative version of the Peterson-Gorenstein-Zierler decoding algorithm for a class of codes that we call skew RS codes. These codes are left ideals of a quotient of a skew polynomial ring, which endow them of a sort of…

Information Theory · Computer Science 2017-03-03 José Gómez-Torrecillas , F. J. Lobillo , Gabriel Navarro

In this article we study a theory of support varieties over a skew complete intersection $R$, i.e. a skew polynomial ring modulo an ideal generated by a sequence of regular normal elements. We compute the derived braided Hochschild…

Rings and Algebras · Mathematics 2021-02-01 Luigi Ferraro , W. Frank Moore , Josh Pollitz

This paper investigates ideal-theoretic as well as homological extensions of the Prufer domain concept to commutative rings with zero divisors in an amalgamated duplication of a ring along an ideal. The new results both compare and contrast…

Commutative Algebra · Mathematics 2016-01-29 M. Chhiti , M. Jarrar , S. Kabbaj , N. Mahdou

Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work.…

Information Theory · Computer Science 2012-01-10 Jiun-Hung Yu , Hans-Andrea Loeliger

In this paper, we construct MDS Euclidean self-dual codes which are extended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized Reed-Solomon codes and…

Information Theory · Computer Science 2016-06-24 Hongxi Tong , Xiaoqing Wang

In this paper we investigate codes over finite commutative rings R, whose generator matrices are built from \$\alpha\$-circulant matrices. For a non-trivial ideal I<R we give a method to lift such codes over R/I to codes over R, such that…

Combinatorics · Mathematics 2015-03-11 Michael Kiermaier , Alfred Wassermann

MDS self-dual codes over finite fields have attracted a lot of attention in recent years by their theoretical interests in coding theory and applications in cryptography and combinatorics. In this paper we present a series of MDS self-dual…

Information Theory · Computer Science 2019-11-14 Aixian Zhang , Keqin Feng

This article begins with an exploration of nonlinear codes ($\mathbb{F}_q$-linear subspaces of $\mathbb{F}_{q^m}^n$) which are generalizations of the familiar Reed-Solomon codes. This then leads to a wider exploration of nonlinear analogues…

Information Theory · Computer Science 2025-02-12 Daniel Bossaller , Daniel Herden , Indalecio Ruiz-Bolanos

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…

Information Theory · Computer Science 2014-05-13 Bocong Chen , San Ling , Guanghui Zhang

The hull of a linear code is defined to be the intersection of the code and its dual. When the size of the hull is small, it has been proved that some algorithms for checking permutation equivalence of two linear codes and computing the…

Information Theory · Computer Science 2020-09-17 Yansheng Wu

For a skew polynomial ring $R=A[X;\theta,\delta]$ where $A$ is a commutative Frobenius ring, $\theta$ an endomorphism of $A$ and $\delta$ a $\theta$-derivation of $A$, we consider cyclic left module codes $\mathcal{C}=Rg/Rf\subset R/Rf$…

Information Theory · Computer Science 2024-07-08 Hedongliang Liu , Cornelia Ott , Felix Ulmer

In this paper, we investigate polycyclic codes associated with a trinomial of arbitrary degree $n$ over a finite chain ring $ R.$ We extend the concepts of $ n $-isometry and $ n $-equivalence known for constacyclic codes to this class of…

Information Theory · Computer Science 2025-03-18 Abdelghaffar Chibloun , Hassan Ou-azzou , Edgar Martínez-Moro , Mustapha Najmeddine

In this note we consider the links of prime ideals of certain skew polynomial rings and prove our main theorem, namely theorem [5], which states the following.Let R be a noetherian ring that is link k-symmetric and let {\sigma} be an…

Rings and Algebras · Mathematics 2013-01-01 C. L. Wangneo

In this paper we introduce the notion of $\lambda$-constacyclic codes over finite rings $R$ for arbitary element $\lambda$ of $R$. We study the non-invertible-element constacyclic codes (NIE-constacyclic codes) over finite principal ideal…

Information Theory · Computer Science 2020-11-25 Hongwei Liu , Jingge Liu
‹ Prev 1 3 4 5 6 7 10 Next ›