Papers by mohammed sabiri
Quantum codes over F<sub>q</sub> from α+βu+γv+δuv+ηu<sup>2</sup>+θv<sup>2</sup>+λu<sup>2</sup>v+μuv<sup>2</sup>+νu<sup>2</sup>v<sup>2</sup>- constacyclic codes
Journal of mechanics of continua and mathematical sciences, Apr 23, 2019
In this work we try to introduce the concept of codes of polynomial type and polynomial codes tha... more In this work we try to introduce the concept of codes of polynomial type and polynomial codes that are built over the ring A[X]/A[X]f(X).It should be noted that for particular cases of f we will find some classic codes for example cyclic codes, constacyclic codes, So the study of these codes is a generalization of linear codes.
Construction of some new quantum codes
Construction of some new quantum codes
2022 5th International Conference on Advanced Communication Technologies and Networking (CommNet)
Construction of Isodual Codes over Finite Rings
2020 3rd International Conference on Advanced Communication Technologies and Networking (CommNet)
This paper considers the construction of isodual cyclic codes over finite rings. We give conditio... more This paper considers the construction of isodual cyclic codes over finite rings. We give conditions on the existence of isodual cyclic codes, used to obtain isodual cyclic codes. We also provide a construction for isodual cyclic codes.
Quantum codes from cyclic codes over Fq + vFq + v2Fq + v3Fq + v4Fq
2021 4th International Conference on Advanced Communication Technologies and Networking (CommNet), 2021
We give a construction of quantum codes over ${\mathbb{F}_q}$ from cyclic codes over a finite non... more We give a construction of quantum codes over ${\mathbb{F}_q}$ from cyclic codes over a finite non-chain ring ${\mathbb{F}_q} + v{\mathbb{F}_q} + {v^2}{\mathbb{F}_q} + {v^3}{\mathbb{F}_q} + {v^4}{\mathbb{F}_q}$, where q=pr, p is an odd prime, 4|p−1 and v5 =v.
Some Properties of Free Cyclic Codes over Finite Chain Rings
Proceedings of the 3rd International Conference on Networking, Information Systems & Security, 2020
Free codes are investigated. It is illustrated that every free cyclic has some important propriet... more Free codes are investigated. It is illustrated that every free cyclic has some important proprieties and the minimal distance of every code depends upon its associated direct component.
Construction of Somme Quasi-Cyclic Codes Over a Finite Rings
Quasi-cyclic codes over a finite commutative ring are viewed as cyclic codes over a noncommutativ... more Quasi-cyclic codes over a finite commutative ring are viewed as cyclic codes over a noncommutative ring of matrices over a finite commutative ring. The study of these codes permits to generalize some known results about quasi-cyclic codes over a finite fields and to propose a construction of some quasi-cyclic codes.
Positivity, 2019
In this paper, we investigate necessary and sufficient conditions under which compact operators b... more In this paper, we investigate necessary and sufficient conditions under which compact operators between Banach lattices must be almost L-weakly compact (resp. almost M-weakly compact). Mainly, it is proved that if X is a non zero Banach space then every compact operator T :X → E (resp. T :E → X) is almost L-weakly compact (resp. almost M-weakly compact) if and only if the norm on E (resp. E) is order continuous. Moreover, we present some interesting connections between almost Lweakly compact and L-weakly compact operators (resp. almost M-weakly compact and M-weakly compact operators).
Maximal Codes for Finite Chain Rings
2019 International Conference on Advanced Communication Technologies and Networking (CommNet), 2019
Coding theory is one of the bases of the information theory, this behind has experienced a specta... more Coding 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 about the maximal codes on finite rings and exactly we will give the form of these codes for finite chain rings, this notion of maximality allows to show that all codes form classes what can server in decoding.
Uploads
Papers by mohammed sabiri