Results 11 to 20 of about 10,192,265 (264)
Network Communication with operators in Dedekind Finite and Stably Finite Rings [PDF]
, 2016 Messages in communication networks often are considered as "discrete" taking values in some finite alphabet (e.g. a finite field). However, if we want to consider for example communication based on analogue signals, we will have to consider messages that
Riis, S
core +4 more sources
, 1970 The theory of near-rings has arisen in a variety of ways. There is a natural desire to generalise the theory of rings and skew fields by relaxing some of their defining axioms.
Holcombe, William Michael Lloyd
core +7 more sources
Characterizations of rings and modules by means of lattices [PDF]
, 1965 PhDIn this thesis we study the relationship between the lattice of submodules and the algebraic structure of a module. The key remark in our study will be the fact that the homomorphisms between two independent submadules of a module can be ...
Stephenson, W.
core +4 more sources
Pathological modules over tame rings [PDF]
, 1976 Brenner S, Ringel CM. Pathological modules over tame rings. Journal of the London Mathematical Society.
Ringel, Claus Michael, Brenner, Sheila
core +1 more source
Codes over an algebra over ring
CoRR, 2019 In this paper, we consider some structures of linear codes over the ring $\mathcal{R}_k=R[v_1,\dots,v_k],$ where $v_i^2=v_i$ forall $i=1,\dots,k),$ and $R$ is a finite commutative Frobenius ring.
Irwansyah, Djoko Suprijanto
openaire +2 more sources
Unramified representations of reductive groups over finite rings [PDF]
, 2009 Lusztig has given a construction of certain representations of reductive groups over finite local principal ideal rings of characteristic p, extending the construction of Deligne and Lusztig of representations of reductive groups over finite fields.
Stasinski, Alexander
core +1 more source
On p-Adic Estimates of Weights in Abelian Codes over Galois Rings [PDF]
, 2005 Let p be a prime. We prove various analogues and generalizations of McEliece's theorem on the p-divisibility of weights of words in cyclic codes over a finite field of characteristic p. Here we consider Abelian codes over various Galois rings.
Katz, Daniel Jerome
core +1 more source
Linear codes over finite rings are trace codes [PDF]
Discrete Mathematics, 2020 Linear codes over finite rings are described here as trace codes for a suitable generalization of the trace called a GF-trace. Cyclic codes over Galois rings are given a trace description as well. The main tools are the notion of trace dual bases, in the case of linear codes, and of normal bases of an extension ring over a ring, in the case of cyclic ...
Lu, Yaqi +3 more
openaire +2 more sources
The primordial tRNA acceptor stem code from theoretical minimal RNA ring clusters
BMC Genetics, 2020 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
Stabilizer codes over Frobenius rings [PDF]
2012 IEEE International Symposium on Information Theory Proceedings, 2012 Quantum error-correcting codes over finite fields have been widely studied, but quantum codes over rings have been left largely unexplored. This paper introduces stabilizer codes over finite Frobenius rings and establishes their connection to classical code. Structural properties of stabilizer codes over finite Frobenius rings are established.
Sushma Nadella, Andreas Klappenecker
openaire +2 more sources