default search action
Alexandre Fotue Tabue
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Sanjit Bhowmick, Alexandre Fotue Tabue, Joydeb Pal
:
On the ℓ-DLIPs of codes over finite commutative rings. Discret. Math. 347(4): 113853 (2024) - 2023
- [j7]Maryam Bajalan
Galois LCD codes over mixed alphabets. Finite Fields Their Appl. 85: 102125 (2023) - [i11]Maryam Bajalan, Javier de la Cruz, Alexandre Fotue Tabue, Edgar Martínez-Moro:
On LCP codes over a mixed ring alphabet. CoRR abs/2309.14217 (2023) - 2022
- [j6]Sarra Talbi, Aicha Batoul, Alexandre Fotue Tabue, Edgar Martínez-Moro
Hulls of cyclic serial codes over a finite chain ring. Finite Fields Their Appl. 77: 101950 (2022) - [i10]Maryam Bajalan, Alexandre Fotue Tabue, Joël Kaboré, Edgar Martínez-Moro:
Galois LCD codes over mixed alphabets. CoRR abs/2202.02843 (2022) - [i9]Sanjit Bhowmick, Alexandre Fotue Tabue, Joydeb Pal:
On the linear 𝓁-intersection pair of codes over a finite principal ideal ring. CoRR abs/2204.00905 (2022) - 2021
- [i8]Sarra Talbi, Aicha Batoul, Alexandre Fotue Tabue, Edgar Martínez-Moro:
Galois hulls of cyclic serial codes over a finite chain ring. CoRR abs/2102.06995 (2021) - 2020
- [j5]Alexandre Fotue Tabue, Edgar Martínez-Moro
On polycyclic codes over a finite chain ring. Adv. Math. Commun. 14(3): 455-466 (2020) - [j4]Sanjit Bhowmick, Alexandre Fotue Tabue, Edgar Martínez-Moro
Do non-free LCD codes over finite commutative Frobenius rings exist? Des. Codes Cryptogr. 88(5): 825-840 (2020) - [j3]Alexandre Fotue Tabue, Edgar Martínez-Moro
Galois correspondence on linear codes over finite chain rings. Discret. Math. 343(2): 111653 (2020)
2010 – 2019
- 2019
- [i7]Sanjit Bhowmick, Alexandre Fotue Tabue, Edgar Martínez-Moro, Ramakrishna Bandi, Satya Bagchi:
Do non-free LCD codes over finite commutative Frobenius rings exist? CoRR abs/1901.10836 (2019) - [i6]Joël Kaboré, Alexandre Fotue Tabue, Kenza Guenda, Mohammed E. Charkani:
Skew-constacyclic codes over $\frac{\mathbb{F}_q[v]}{\langle\, v^q-v\, \rangle}$. CoRR abs/1902.10477 (2019) - 2018
- [j2]Ramakrishna Bandi
On counting subring-submodules of free modules over finite commutative frobenius rings. Des. Codes Cryptogr. 86(10): 2247-2254 (2018) - [j1]Alexandre Fotue Tabue, Christophe Mouaha:
Contraction of cyclic codes over finite chain rings. Discret. Math. 341(6): 1722-1731 (2018) - [i5]Edgar Martínez-Moro, Alexandre Fotue Tabue, Thomas Blackford:
On polycyclic codes over a finite chain ring. CoRR abs/1811.07975 (2018) - 2017
- [i4]Alexandre Fotue Tabue, Christophe Mouaha:
Contraction of Cyclic Codes Over Finite Chain Rings. CoRR abs/1701.08736 (2017) - [i3]Alexandre Fotue Tabue, Christophe Mouaha:
On the Lattice of Cyclic Linear Codes Over Finite Chain Rings. CoRR abs/1701.08740 (2017) - 2016
- [i2]Alexandre Fotue Tabue, Edgar Martínez-Moro, Christophe Mouaha:
Galois Correspondence on Linear Codes over Finite Chain Rings. CoRR abs/1602.01242 (2016) - [i1]Ramakrishna Bandi, Alexandre Fotue Tabue, Edgar Martínez-Moro:
On Counting Subring-Subcodes of Free Linear Codes Over Finite Principal Ideal Rings. CoRR abs/1612.02213 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: