Results 11 to 20 of about 2,012,640 (258)
A note on repeated-root cyclic codes [PDF]
IEEE Transactions on Information Theory, 1991 G. Castagnoli et al. (see ibid., vol.37, no.2, p.337-42, 1991) and J.H. van Lint (see ibid., vol.37, no.2, p.343-5, 1991) analyzed cyclic codes with repeated roots. These studies fail to acknowledge a previous work by C.L. Chen (1969) which includes an analysis of even-length binary cyclic codes. Results from Chen's study are presented. >
Morelos-Zaragoza, Robert H
openaire +6 more sources
On the structure of repeated-root polycyclic codes over local rings [PDF]
Discrete Mathematics, 2023 This paper provides the Generalized Mattson Solomon polynomial for repeated-root polycyclic codes over local rings that gives an explicit decomposition of them in terms of idempotents that completes the single root study. It also states some structural properties of repeated-root polycyclic codes over finite fields in terms of matrix product codes ...
Maryam Bajalan +4 more
openaire +3 more sources
AMDS Symbol-Pair Codes from Repeated-Root Cyclic Codes
CoRR, 2022 arXiv admin note: text overlap with arXiv:2010.04329.
Ma, Junru
openaire +4 more sources
MDS and AMDS symbol-pair codes constructed from repeated-root codes
CoRR, 2022 22 pages.
Xiuxin Tang, Rong Luo
openaire +3 more sources
On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots [PDF]
Designs, Codes and Cryptography, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
San Ling +2 more
openaire +5 more sources
New QEC codes and EAQEC codes from repeated-root cyclic codes of length $2^rp^s$ [PDF]
CoRRLet $p$ be an odd prime and $r,s,m$ be positive integers. In this study, we initiate our exploration by delving into the intricate structure of all repeated-root cyclic codes and their duals with a length of $2^rp^s$ over the finite field $\mathbb{F}_{p^m}$.
Lanqiang Li +3 more
core +4 more sources
Repeated-root Constacyclic Codes with Optimal Locality
CoRR, 2021 A code is called a locally repairable code (LRC) if any code symbol is a function of a small fraction of other code symbols. When a locally repairable code is employed in a distributed storage systems, an erased symbol can be recovered by accessing only a small number of other symbols, and hence alleviating the network resources required during the ...
Wei Zhao 0049 +2 more
openaire +3 more sources
Repeated-root cyclic codes [PDF]
IEEE Transactions on Information Theory, 1991 In the theory of cyclic codes, it is common practice to require that (n,q)=1, where n is the word length and F/sub q/ is the alphabet. It is shown that the even weight subcodes of the shortened binary Hamming codes form a sequence of repeated-root cyclic codes that are optimal.
openaire +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
IEEE Access, 2019 MDS codes have the highest possible error-detecting and error-correcting capability among codes of given length and size. Let p be any prime, and s, m be positive integers.
H. Q. Dinh +5 more
doaj +1 more source