Related papers: Duality for Modules and Applications to Decoding L…
In this paper, we extend the work of (Abbondati et al., 2024) on decoding simultaneous rational number codes by addressing two important scenarios: multiplicities and the presence of bad primes (divisors of denominators). First, we…
This paper present the construction cyclic isodual codes over finite fields and finite chain rings. These codes are monomially equivalent to their dual. Conditions are given for the existence of cyclic isodual codes. In addition, the…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over…
In this paper we present a new approach to Grothendieck duality over commutative rings. Our approach is based on the idea of rigid dualizing complexes, which was introduced by Van den Bergh in the context of noncommutative algebraic…
We define generalized Hamming weights for almost affine codes. We show how various aspects and applications of generalized Hamming weights for linear codes, such as Wei duality, generalized Kung's bound, profiles, connection to wire-tap…
Mappings between models may be obtained by unitary transformations with preservation of the spectra but in general a change in the states. Non- canonical transformations in general also change the statistics of the operators involved. In…
Deterministic recursive algorithms for the computation of matrix triangular decompositions with permutations like LU and Bruhat decomposition are presented for the case of commutative domains. This decomposition can be considered as a…
We derive the spectral domain properties of two-dimensional (2-D) $(\lambda_1, \lambda_2)$-constacyclic codes over $\mathbb{F}_q$ using the 2-D finite field Fourier transform (FFFT). Based on the spectral nulls of 2-D $(\lambda_1,…
This paper investigates the theory of sum-rank metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory…
A (control) network over a finite ring is proposed. Using semi-tensor product (STP) of matrices, a set of algebraic equations are provided to verify whether a finite set with two binary operators is a ring. It is then shown that the…
We discuss duality pairings on integral \'etale motivic cohomology groups of regular and proper schemes over algebraically closed fields, local fields, finite fields, and arithmetic schemes.
We apply the super duality formalism recently developed by the authors to obtain new equivalences of various module categories of general linear Lie superalgebras. We establish the correspondence of standard, tilting, and simple modules, as…
This article concerns linear parts of minimal resolutions of finitely generated modules over commutative local, or graded rings. The focus is on the linearity defect of a module, which marks the point after which the linear part of its…
Sum-rank codes are an important class of codes which can be utilized for linear network coding, space-time coding and distributed storage. They can not only reduce the size of network alphabet but also detect and correct more errors. Based…
We develop a framework for combining differentiable programming languages with neural networks. Using this framework we create end-to-end trainable systems that learn to write interpretable algorithms with perceptual components. We explore…
We extend Latimer and MacDuffee's theorem to a general commutative domain and apply this result to study similarity of matrices over integral rings of number fields. We also conjecture similarity over discrete valuation rings can be descent…
In this paper we characterize the modules and the complexes involved in the dualities induced by a 1-cotilting bimodule in terms of a linear compactness condition. Our result generalizes the classical characterization of reflexive modules…
Let $(R,\fm)$ be a Cohen-Macaulay local ring. If $R$ has a canonical module, then there are some interesting results about duality for this situation. In this paper, we show that one can indeed obtain similar these results in the case $R$…
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…
It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…