Results 1 to 10 of about 105,712 (106)
Bounds for Coding Theory over Rings
Coding theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. It has been well established that, with the generalization of the algebraic structure to rings, there is
Niklas Gassner +3 more
doaj +1 more source
Two New Classes of Codebooks Asymptotically Achieving the Welch Bound
Exponential sums over Galois rings have many applications in coding theory, cryptography and algebraic combinatorics. In this article, we employ additive characters and multiplicative characters over Galois rings to present two classes of codebooks, and ...
Shimin Sun, Li Han, Yang Yan, Yao Yao
doaj +1 more source
On the State Approach Representations of Convolutional Codes over Rings of Modular Integers
In this study, we prove the existence of minimal first-order representations for convolutional codes with the predictable degree property over principal ideal artinian rings.
Ángel Luis Muñoz Castañeda +2 more
doaj +1 more source
Nonassociative Algebras, Rings and Modules over Them
The review is devoted to nonassociative algebras, rings and modules over them. The main actual and recent trends in this area are described. Works are reviewed on radicals in nonassociative rings, nonassociative algebras related with skew polynomials ...
Sergey Victor Ludkowski
doaj +1 more source
In this paper, by integrating the phase-cancellation and absorption mechanisms, we proposed and experimentally demonstrated a light-weight coding metamaterial for broadband, wide-angle and polarization-independent radar cross section (RCS) reduction ...
Wei Fang +3 more
doaj +1 more source
Prime Graph over Cartesian Product over Rings and Its Complement
Graph theory is a branch of algebra that is growing rapidly both in concept and application studies. This graph application can be used in chemistry, transportation, cryptographic problems, coding theory, design communication network, etc.
Farah Maulidya Fatimah +2 more
doaj +1 more source
A Note on Powers in Finite Fields [PDF]
The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research.
Aabrandt, Andreas +1 more
core +2 more sources
The primordial tRNA acceptor stem code from theoretical minimal RNA ring clusters
Background Theoretical minimal RNA rings code by design over the shortest length once for each of the 20 amino acids, a start and a stop codon, and form stem-loop hairpins. This defines at most 25 RNA rings of 22 nucleotides. As a group, RNA rings mimick
Jacques Demongeot, Hervé Seligmann
doaj +1 more source
How to obtain lattices from (f,σ,δ)-codes via a generalization of Construction A [PDF]
We show how cyclic (f,σ,δ)-codes over finite rings canonically induce a Z-lattice in RN by using certain quotients of orders in nonassociative division algebras defined using the skew polynomial f.
A Batoul +47 more
core +3 more sources
On Linear Coding over Finite Rings and Applications to Computing
This paper presents a coding theorem for linear coding over finite rings, in the setting of the Slepian–Wolf source coding problem. This theorem covers corresponding achievability theorems of Elias (IRE Conv. Rec. 1955, 3, 37–46) and Csiszár (IEEE Trans.
Sheng Huang, Mikael Skoglund
doaj +1 more source

