English
Related papers

Related papers: Duality for Modules and Applications to Decoding L…

200 papers

In this paper we study local cohomology of finitely generated bigraded modules over a standard bigraded ring with respect to the irrelevant bigraded ideals and establish a duality theorem. Several applications are considered.

Commutative Algebra · Mathematics 2007-05-23 Juergen Herzog , Ahad Rahimi

An important class of codes widely used in applications is the class of convolutional codes. Most of the literature of convolutional codes is devoted to con- volutional codes over finite fields. The extension of the concept of convolutional…

Rings and Algebras · Mathematics 2016-01-21 Mohammed El Oued , Diego Napp , Raquel Pinto , Marisa Toste

In this note we study the weak topology on paired modules over a (not necessarily commutative) ground ring. Over QF rings we are able to recover most of the well known properties of this topology in the case of commutative base fields. The…

Rings and Algebras · Mathematics 2007-05-23 Jawad Y. Abuhlail

We initiate the study of the duality theory of locally recoverable codes, with a focus on the applications. We characterize the locality of a code in terms of the dual code, and introduce a class of invariants that refine the classical…

Information Theory · Computer Science 2022-12-16 Anina Gruica , Benjamin Jany , Alberto Ravagnani

Let R be a commutative ring with identity and M be an R-module. The purpose of this paper is to introduce and investigate the dual notion of morphic modules over a commutative ring.

Commutative Algebra · Mathematics 2025-01-20 Faranak Farshadifar

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…

Information Theory · Computer Science 2024-11-11 Maryam Bajalan , Edgar Martínez-Moro , Steve Szabo

We consider generalizations of Reed-Muller codes, toric codes, and codes from certain plane curves, such as those defined by norm and trace functions on finite fields. In each case we are interested in codes defined by evaluating arbitrary…

Information Theory · Computer Science 2007-07-16 Maria Bras-Amorós , Michael E. O'Sullivan

In this paper, we will introduce two generalizations of second submodules of a module over a commutative ring and explore some basic properties of these classes of modules.

Commutative Algebra · Mathematics 2016-09-27 H. Ansari-Toroghy , F. Farshadifar

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…

Information Theory · Computer Science 2017-05-30 Ashkan Nikseresht

In this paper we take some classical ideas from commutative algebra, mostly ideas involving duality, and apply them in algebraic topology. To accomplish this we interpret properties of ordinary commutative rings in such a way that they can…

Algebraic Topology · Mathematics 2007-05-23 W. G. Dwyer , J. P. C. Greenlees , S. Iyengar

We investigate some general machinery for describing semidualizing modules over generic constructions like ladder determinantal rings with coefficients in a normal domain. We also pose and investigate natural localization questions that…

Commutative Algebra · Mathematics 2020-01-01 Sean K. Sather-Wagstaff , Tony Se , Sandra Spiroff

Linear complementary dual (LCD) codes over finite fields are linear codes satisfying $C\cap C^{\perp}=\{0\}$. We generalize the LCD codes over finite fields to $\mathbb{Z}_2\mathbb{Z}_2[u]$-LCD codes over the ring…

Information Theory · Computer Science 2019-03-28 Hu Peng , Liu Xiusheng

This paper investigates the algebraic structure of additive complementary pairs of cyclic codes over a finite commutative ring. We demonstrate that for every additive complementary pair of additive cyclic codes, both constituent codes are…

Information Theory · Computer Science 2025-06-13 Sanjit Bhowmick , Kuntal Deka , Alexandre Fotue Tabue , Edgar Martínez-Moro

This paper investigates the concept of self-dual convolutional code. We derive the basic properties of this interesting class of codes and we show how some of the techniques to construct self-dual linear block codes generalize to self-dual…

Information Theory · Computer Science 2022-08-09 Sebastian Heri , Julia Lieb , Joachim Rosenthal

Given a finite ring $A$ which is a free left module over a subring $R$ of $A$, two types of $R$-bases, pseudo-self-dual bases (similar to trace orthogonal bases) and symmetric bases, are defined which in turn are used to define duality…

Information Theory · Computer Science 2016-08-08 Steve Szabo , Felix Ulmer

In this paper, several conjectures proposed in [2] are studied, involving the equivalence and duality of polycyclic codes associated with trinomials. According to the results, we give methods to construct isodual and self-dual polycyclic…

Information Theory · Computer Science 2022-05-03 Minjia Shi , Haodong Lu , Shuang Zhou , Jiarui Xu , Yuhang Zhu

We give a description of the duals of linearized Reed-Solomon codes in terms of codes obtained by taking residues of Ore rational functions. Our construction shows in particular that, under some assumptions on the base field, the class of…

Information Theory · Computer Science 2021-10-26 Xavier Caruso , Amaury Durand

We give a generalization of Poitou-Tate duality to schemes of finite type over rings of integers of global fields.

Number Theory · Mathematics 2019-02-20 Thomas H. Geisser , Alexander Schmidt

Additive cyclic codes over Galois rings were investigated in previous works. In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative…

Information Theory · Computer Science 2017-01-25 Edgar Martínez-Moro , Kamil Otal , Ferruh Özbudak

This work introduces a decoding strategy for binary self-dual codes possessing an automorphism of a specific type. The proposed algorithm is a hard decision iterative decoding scheme. The enclosed experiments show that the new decoding…

Information Theory · Computer Science 2021-06-22 Radinka Yorgova
‹ Prev 1 2 3 10 Next ›