Results 241 to 250 of about 3,398,533 (269)
Some of the next articles are maybe not open access.
Abhandlungen Aus Dem Mathematischen Seminar Der Universitat Hamburg, 1973
David A Drake
exaly +2 more sources
David A Drake
exaly +2 more sources
Critical Problem for codes over finite chain rings
Finite Fields and Their Applications, 2021The authors investigate the critical problem, which was introduced in matroid theory and is the problem of finding the maximum dimension of a subspace that contains no element of a fixed subset. The original problem was stated by \textit{H. H. Crapo} and \textit{G. C.
Koji Imamura, Keisuke Shiromoto
openaire +1 more source
l-LIPs of codes over finite chain rings
Discrete Mathematics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiusheng Liu, Peng Hu
openaire +2 more sources
LCP of constacyclic codes over finite chain rings
Journal of Applied Mathematics and Computing, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ridhima Thakral +2 more
openaire +3 more sources
Maximal Codes for Finite Chain Rings
2019 International Conference on Advanced Communication Technologies and Networking (CommNet), 2019Coding theory is one of the bases of the information theory, this behind has experienced a spectacular evolution exploiting what has been achieved in the codes by the use of the concept of algebra. So to ensure a good transfer of information, it is better to use good codes by using a few aspects which represents an advantage. In this work, we will talk
openaire +2 more sources
On Minimal Realization Over a Finite Chain Ring
Designs, Codes and Cryptography, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Quantum codes over a class of finite chain ring
Quantum Information and Computation, 2016In this study, we introduce a new Gray map which preserves the orthogonality from the chain ring F_2 [u] / (u^s ) to F^s_2 where F_2 is the finite field with two elements. We also give a condition of the existence for cyclic codes of odd length containing its dual over the ring F_2 [u] / (u^s ) .
Siap, Irfan, Sarı, Mustafa
openaire +3 more sources
Properties of finite unrefinable chains of ring topologies
Journal of Mathematical Sciences, 2012Rings are not necessarily associative, topological spaces not necessarily Hausdorff. It is known that the set of all ring topologies on a ring \(R\) forms a lattice. The author studies the following question related to the Schmidt-Ore theorem about principal series in modular lattices: Let \(R\) be a ring, \(\mathfrak M\) a lattice of ring topologies ...
openaire +2 more sources
Finite maximal chains of commutative rings
Journal of Algebra and Its Applications, 2014Let R ⊆ S be a unital extension of commutative rings, with [Formula: see text] the integral closure of R in S, such that there exists a finite maximal chain of rings from R to S. Then S is a P-extension of R, [Formula: see text] is a normal pair, each intermediate ring of R ⊆ S has only finitely many prime ideals that lie over any given prime ideal of
Ayache, Ahmed, Dobbs, David E.
openaire +2 more sources
$$\sigma $$-LCD codes over finite chain rings
Designs, Codes and Cryptography, 2019In this paper, the authors studied the $\sigma$-LCD codes over finite chain rings. They characterize $\sigma$-LCD linear codes over finite chain rings by using their generator matrix. A necessary and sufficient condition for a linear code to be $\sigma$-LCD over a series of finite chain rings is given.
Liu, Xiusheng, Liu, Hualu
openaire +2 more sources

