Results 231 to 240 of about 3,045,703 (258)
Some of the next articles are maybe not open access.
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
exaly +3 more sources
Cyclic and Negacyclic Codes Over Finite Chain Rings
IEEE Transactions on Information Theory, 2004The structures of cyclic and negacyclic codes of length n and their duals over a finite chain ring R are established when n is not divisible by the characteristic of the residue field R~. Some cases where n is divisible by the characteristic of the residue field R~ are also considered.
Hai Quang Dinh 0001 +1 more
exaly +3 more sources
On Isodual Cyclic Codes over Finite Chain Rings
Lecture Notes in Computer Science, 2017In this work, cyclic isodual codes over finite chain rings are investigated. These codes are monomially equivalent to their duals. Existence results for cyclic isodual codes are given based on the generator polynomials, the field characteristic, and the length. Several constructions of isodual and self-dual codes are also presented.
Aaron Gulliver +2 more
exaly +2 more sources
Remarks on finite pseudo-chain rings
Ricerche Di MatematicaThe authors of this paper under review define the pseudo-chain rings, which is a slight generalization of pseudo-valuation rings defined in [\textit{A. Badawi} et al., Lect. Notes Pure Appl. Math. 185, 57--67 (1997; Zbl 0880.13011)], which is in turn a generalization of pseudo-valuation domains defined by \textit{J. R. Hedstrom} and \textit{E.
Boran Kim, Hyun Seung Choi
exaly +3 more sources
LIFTED CODES OVER FINITE CHAIN RINGS [PDF]
Mathematical Journal of Okayama University, 2011 In this paper, we study lifted codes over finite chain rings. We use γ-adic codes over a formal power series ring to study codes over finite chain rings.
Dougherty, Steven T. +2 more
openaire +3 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
Additive cyclic codes over finite commutative chain rings [PDF]
Discrete Mathematics, 2018 Additive cyclic codes over Galois rings were investigated in Cao et al. (2015). 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 chain rings,
Kamil Otal +2 more
exaly +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
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