Jamal Laaouine

Orcid: 0000-0002-8623-6094

According to our database1, Jamal Laaouine authored at least 9 papers between 2019 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Polycyclic codes over Fpm[u]/〈u2〉: Classification, Hamming distance, and annihilators.
Finite Fields Their Appl., June, 2023

On the classification of ideals over R[X]/〈f(X)<sup>p<sup>s</sup></sup>〉 when R=𝔽<sub>p^{m}</sub>+u𝔽<sub>p^{m}</sub>+\ldots +u^{n}𝔽<sub>p^{m}</sub>.
Cryptogr. Commun., May, 2023

Complete classification of cyclic codes of length 3ps over 픽pm + u픽pm + u2픽pm.
Discret. Math. Algorithms Appl., April, 2023

A note on "H. Q. Dinh et al., Hamming distance of repeated-root constacyclic codes of length 2p<sup>s</sup> over 픽<sub>p<sup>m</sup></sub>+ u픽<sub>p<sup>m</sup></sub>".
Appl. Algebra Eng. Commun. Comput., March, 2023

MDS symbol-pair repeated-root constacylic codes of prime power lengths over $$\mathbb {F}_{q}+ u\mathbb {F}_{q} + u^{2}\mathbb {F}_{q} $$.
J. Appl. Math. Comput., February, 2023

New quantum codes from negacyclic codes of length p<sup>s</sup> over ${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$.
Quantum Inf. Process., January, 2023

2021
Complete classification of repeated-root σ-constacyclic codes of prime power length over Fpm[u]∕〈u3〉.
Discret. Math., 2021

Hamming Distance of Constacyclic Codes of Length p<sup>s</sup> Over F<sub>p<sup>m</sup></sub>+uF<sub>p<sup>m</sup></sub>+u²F<sub>p<sup>m</sup></sub>.
IEEE Access, 2021

2019
On the Hamming and Symbol-Pair Distance of Constacyclic Codes of Length p<sup>s</sup> over $\mathbb {F}_{p^m}+ u\mathbb {F}_{p^m}$.
Proceedings of the Advanced Communication Systems and Information Security, 2019


  Loading...