Results 11 to 20 of about 258,202 (236)
A Note on Repeated-Root Cyclic Codes [PDF]
IEEE Transactions on Information Theory, 1991 In papers by Castagnoli et al. and Van Lint, cyclic codes with repeated roots are analyzed. Both papers fail to acknowledge a previous work by Chen, dating back to 1969, which includes an analysis of even, length binary cyclic codes.
Morelos-Zaragoza, Robert H
core +6 more sources
Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes [PDF]
Finite Fields and Their Applications, 2012 Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring.
Lopez-Permouth, Sergio R. +3 more
core +3 more sources
MDS symbol-pair codes from repeated-root cyclic codes [PDF]
Designs, Codes and Cryptography, 2021 arXiv admin note: text overlap with arXiv:2010 ...
Junru Ma, Jinquan Luo
openaire +2 more sources
Repeated-root constacyclic codes of length 6lp^s
Advances in Mathematics of Communications, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wu, Tingting +3 more
openaire +2 more sources
On repeated-root cyclic codes [PDF]
IEEE Transactions on Information Theory, 1991 A parity-check matrix for a q-ary repeated-root cyclic code is derived using the Hasse derivative. Then the minimum distance of a q-ary repeated-root cyclic code is expressed in terms of the minimum distance of a certain simple-root cyclic code. With the help of this result, several binary repeated-root cyclic codes of lengths up to n=62 are shown to ...
G. Castagnoli +3 more
openaire +1 more source
Some Repeated-Root Constacyclic Codes Over Galois Rings [PDF]
IEEE Transactions on Information Theory, 2017 Codes over Galois rings have been studied extensively during the last three decades. Negacyclic codes over $GR(2^a,m)$ of length $2^s$ have been characterized: the ring $\mathcal{R}_2(a,m,-1)= \frac{GR(2^a,m)[x]}{\langle x^{2^s}+1\rangle}$ is a chain ring.
Hongwei Liu, Youcef Maouche
openaire +2 more sources
IEEE Access, 2020 Let p ≠ 3 be any prime. The structures of all λ-constacyclic codes of length 3ps over the finite commutative chain ring Fpm + uFpm (u2 = 0) are established in the term of their generator polynomials.
Hai Q. Dinh +2 more
doaj +1 more source
On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6
IEEE Access, 2020 Let $p$ be an odd prime, $s$ , $m$ be positive integers such that $p^{m}\equiv 2 \pmod 3$ . In this paper, using the relationship about Hamming distances between simple-root cyclic codes and repeated-root cyclic codes, the Hamming distance of all ...
Hai Q. Dinh +2 more
doaj +1 more source
Effectiveness of Prophylactic Gelophen and Advil in Reducing Post-endodontic Pain [PDF]
Journal of Mashhad Dental School, 2018 Introduction: Due to the association of post- and pre-endodontic pain, using non-steroidal anti-inflammatory drugs (NSAIDs) before root canal therapy could interfere with the subsequent inflammatory process and reduce post-endodontic pain.
Mohammad Mahdi Yaghooti Khorasani +1 more
doaj +1 more source
On the Hamming Distances of Constacyclic Codes of Length 5
IEEE Access, 2020 Let $p$ be a prime, $s$ , $m$ be positive integers, and $\lambda $ be a nonzero element of the finite field $\mathbb {F}_{p^{m}}$ . In this paper, the algebraic structures of constacyclic codes of length $5~p^{s}~(p\neq 5)$ are obtained, which ...
Hai Q. Dinh +2 more
doaj +1 more source