Home › Researcher directory › M. E. Charkani
M. E. Charkani
Affiliation : Sidi Mohamed Ben Abdellah University
- 26Publications (affiliation in Morocco)
- 45Total publications
- 94Citations
- 4h-index
Research profile
M. E. Charkani has 26 indexed publications (2003–2026). Their work appears mainly in “Boletim da Sociedade Paranaense de Matemática”, “Gulf Journal of Mathematics” and “Asian-European Journal of Mathematics”. Their most cited article, “Complete classification of repeated-root σ -constacyclic codes of prime power length over Fpm[u]∕〈u3〉” (2021), has been cited 18 times. 3 of these publications date from the last three years of activity. Their work is co-authored with at least 11 researchers.
Is this you? Get your research seen
Create your free DzCademia profile and add your articles: they will show up more easily on Google and in AI assistants like ChatGPT, so more people can read and cite your work.
Create my free profile Add my publicationsResearch areas
- Rings, Modules, and Algebras
- Coding theory and cryptography
- Algebraic Geometry and Number Theory
- Cryptography and Residue Arithmetic
- Advanced Topics in Algebra
Publications (26)
- On skew cyclic reversible DNA codes over F_4[v]/
- On the centralizer of a matrix and wild problem
- On the ideal discriminant of some relative pure extensions
- New quantum codes from negacyclic codes of length $$p^s$$ over $${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$$
- MDS symbol-pair repeated-root constacylic codes of prime power lengths over $$\mathbb {F}_{q}+ u\mathbb {F}_{q} + u^{2}\mathbb {F}_{q} $$
- Complete classification of cyclic codes of length 3ps over 𝔽pm + u𝔽pm + u2𝔽pm
- Complete classification of negacyclic codes of length 3ps over 𝔽pm + u𝔽pm + u2𝔽pm
- On the isomorphism problem for split extensions
- On the classification of ideals over $R[X]/\langle f(X)^{p^{s}}\rangle $ when $R=\mathbb {F}_{p^{m}}+u\mathbb {F}_{p^{m}}+\ldots +u^{n}\mathbb {F}_{p^{m}}$
- The canonical form of multiplication modules
- Complete classification of repeated-root σ -constacyclic codes of prime power length over Fpm[u]∕〈u3〉
- Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over \({{\mathbb{F}_{p^m}[u]}/{\langle u^3\rangle}}\)
- Hamming Distance of Constacyclic Codes of Length ps Over F pm +uF pm +u²F pm
- A note on “H. Q. Dinh et al., Hamming distance of repeated-root constacyclic codes of length $$2p^{s}$$ over $${\mathbb{F}}_{p^{m}}+ u{\mathbb{F}}_{p^{m}}$$”
- Tower Index formula and monogenecity
- CF-Permutation modules
- Primitive idempotents and constacyclic codes over finite chain rings
- On Non-split Abelian Extensions
- New quantum codes from cyclic codes over finite chain ring of length 3
- Presentation matrices of torsion modules over polynomial rings
- Constacyclic codes over F_q + u F_q + v F_q + u v F_q
- Finitely Generated Modules over Group Rings of a Direct Product of Two Cyclic Groups
- On Constacyclic codes over ℤpm
- Interactions between number theory and ring theory
- On Dedekind′s criterion and monogenicity over Dedekind rings
- Modular representations of Loewy length two
Publication venues
- Boletim da Sociedade Paranaense de Matemática × 4
- Gulf Journal of Mathematics × 3
- Asian-European Journal of Mathematics × 2
- International Journal of Mathematics and Mathematical Sciences × 2
- Quantum Information Processing × 1
- Journal of Applied Mathematics and Computing × 1
Publications per year
- 20261
- 20251
- 20241
- 20231
- 20226
- 20216
- 20203
- 20191
- 20151
- 20142
Collaborations
Partner institutions : Université Ibn-Tofail · Université Ibn Zohr
Co-authors
- Jamal Laaouine
- Brahim Boudine
- Joël Kaboré
- Noureddine Snanou
- Ahmed Najim
- Smail Bouarga
- O. Lahlou
- Souad Bouhamidi
- Abderazak Soullami
- Mohammed Sahmoudi
- Omar Boughaleb
Bibliographic data from OpenAlex (open database).
Why choose Dzcademia?
Profiles, articles and conference contributions: give your research a structured public presence. Integrated metadata help search engines and AI assistants identify your work and understand its references.
Comment with Google
Sign in with Google to comment directly on this page.