Zobrazeno 1 - 10
of 151
pro vyhledávání: '"Hai Q. Dinh"'
Publikováno v:
IEEE Access, Vol 11, Pp 92898-92912 (2023)
In this paper, we investigate self-dual double circulant, and self-dual and linear complementary dual (LCD) double negacirculant codes over a finite ring $R = \mathbb F_{q} + u \mathbb F_{q} + v \mathbb F_{q} + uv\mathbb F_{q}$ , where $u^{2}=u$ , $v
Externí odkaz:
https://doaj.org/article/4c927dc87fab4826ada2368653a939cb
Publikováno v:
IEEE Access, Vol 11, Pp 23578-23585 (2023)
Let $p\not =3$ be any prime. In this paper, we completely determine symbol-triple distance of all $\gamma $ -constacyclic codes of length $3p^{s}$ over the finite commutative chain ring ${\mathcal{ R}}=\mathbb F_{p^{m}}+u\mathbb F_{p^{m}}$ , where $\
Externí odkaz:
https://doaj.org/article/206ee2eca47442d692262886510e80f3
Publikováno v:
IEEE Access, Vol 10, Pp 119883-119904 (2022)
Let $p\not =5$ be any odd prime. Using the algebraic structures of all cyclic codes of length $5p^{s}$ over the finite commutative chain ring ${\mathcal{ R}}=\mathbb F_{p^{m}}+u\mathbb F_{p^{m}}$ , in this paper, the exact values of Hamming distances
Externí odkaz:
https://doaj.org/article/535e8534f8f04c198ce1afe3b1ac155b
Publikováno v:
Axioms, Vol 12, Iss 3, p 254 (2023)
Let p≠3 be any prime. In this paper, we compute symbol-pair distance of all γ-constacyclic codes of length 3ps over the finite commutative chain ring R=Fpm+uFpm, where γ is a unit of R which is not a cube in Fpm. We give the necessary and suffici
Externí odkaz:
https://doaj.org/article/498c33c315624801a673edb47ce3fa59
Publikováno v:
IEEE Access, Vol 9, Pp 137970-137990 (2021)
Symbol-pair codes are used to protect against symbol-pair errors in high density data storage systems. One of the most important tasks in symbol-pair coding theory is to design MDS codes. MDS symbol-pair codes are optimal in the sense that such codes
Externí odkaz:
https://doaj.org/article/e6a6b01956f141d2827d6fdc37224c98
Publikováno v:
IEEE Access, Vol 9, Pp 141064-141078 (2021)
Let $p$ be any prime, $s$ and $m$ be positive integers. In this paper, we completely determine the Hamming distance of all constacyclic codes of length $p^s$ over the finite commutative chain ring $\mathbb {F}_{p^m}+ u\mathbb {F}_{p^m} + u^{2}\mathbb
Externí odkaz:
https://doaj.org/article/fd8b8356431649eb998bd270452829a2
Publikováno v:
IEEE Access, Vol 9, Pp 138543-138552 (2021)
In this paper, we use the CSS and Steane’s constructions to establish quantum error-correcting codes (briefly, QEC codes) from cyclic codes of length $6p^{s}$ over $\mathbb F_{p^{m}}$ . We obtain several new classes of QEC codes in the sense that t
Externí odkaz:
https://doaj.org/article/41283b78bedf48229153018664715e8b
Publikováno v:
IEEE Access, Vol 8, Pp 55550-55562 (2020)
Let F2(m) be a finite field of 2m elements, λ and k be integers satisfying λ, k ≥ 2 and denote R = F2(m)[u]/(u2λ). Let δ, α ∈ F2(m)×. For any odd positive integer n, we give an explicit representation and enumeration for all distinct (δ +
Externí odkaz:
https://doaj.org/article/e52f280e83e847d28bc4300d6a7e75b4
Publikováno v:
IEEE Access, Vol 8, Pp 124608-124623 (2020)
Let p be an odd prime, and Fp(m) is the finite field of pm elements. In this paper, all maximum distance separable (briefly, MDS) cyclic and negacyclic codes of length 2ps over Fp(m) are established. As an application, all quantum MDS (briefly, qMDS)
Externí odkaz:
https://doaj.org/article/e690c64d877e4fa591b9129e819e8968
Publikováno v:
IEEE Access, Vol 8, Pp 18902-18914 (2020)
Let p be an odd prime, q = pm, R = Fq + uFq with u2 = 1, and S = Fq + uFq + vFq + uvFq with u2 = 1, v2 = 1, uv = vu. In this paper, FqRS-cyclic codes over FqRS are studied. As an application, we present a construction of quantum error-correcting code
Externí odkaz:
https://doaj.org/article/12df92e6234b486d9f04a06be2a42050