default search action
René Rodríguez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Xiaoni Du, René Rodríguez
, Hao Wu:
Infinite families of minimal binary codes via Krawtchouk polynomials. Des. Codes Cryptogr. 92(6): 1455-1475 (2024) - [c2]Xiaomeng Sun, Wenying Zhang, René Rodríguez, Huimin Liu:
Known-Key Attack on GIFT-64 and GIFT-64[g0c] Based on Correlation Matrices. ACISP (1) 2024: 20-40 - 2023
- [j5]René Rodríguez
, Yongzhuang Wei, Enes Pasalic:
A theoretical analysis of generalized invariants of bijective S-boxes. Cryptogr. Commun. 15(3): 487-512 (2023) - [i5]René Rodríguez, Enes Pasalic, Fengrong Zhang, Yongzhuang Wei:
Minimal p-ary codes from non-covering permutations. IACR Cryptol. ePrint Arch. 2023: 438 (2023) - [i4]Xiaoni Du, René Rodríguez, Hao Wu:
Infinite families of minimal binary codes via Krawtchouk polynomials. IACR Cryptol. ePrint Arch. 2023: 1209 (2023) - 2022
- [j4]Fengrong Zhang, Enes Pasalic, René Rodríguez
, Yongzhuang Wei:
Minimal binary linear codes: a general framework based on bent concatenation. Des. Codes Cryptogr. 90(5): 1289-1318 (2022) - 2021
- [j3]Enes Pasalic, René Rodríguez
, Fengrong Zhang
, Yongzhuang Wei:
Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound. Cryptogr. Commun. 13(5): 637-659 (2021) - [j2]Fengrong Zhang
, Enes Pasalic, René Rodríguez
, Yongzhuang Wei:
Wide minimal binary linear codes from the general Maiorana-McFarland class. Des. Codes Cryptogr. 89(7): 1485-1507 (2021) - 2020
- [i3]Yongzhuang Wei, René Rodríguez, Enes Pasalic:
Cycle structure of generalized and closed loop invariants. IACR Cryptol. ePrint Arch. 2020: 1095 (2020) - [i2]Enes Pasalic, René Rodríguez, Fengrong Zhang, Yongzhuang Wei:
Several classes of minimal binary linear codes violating the Aschikhmin-Barg's bound. IACR Cryptol. ePrint Arch. 2020: 1131 (2020) - [i1]Fengrong Zhang, Enes Pasalic, René Rodríguez, Yongzhuang Wei:
A huge class of infinite sequences of minimal binary linear codes with or without crossing the Ashikhmin-Barg's bound. IACR Cryptol. ePrint Arch. 2020: 1398 (2020)
2010 – 2019
- 2015
- [j1]César Covantes, René Rodríguez:
Design of Multi-Agent System for Solution of the School Timetabling Problem. Res. Comput. Sci. 106: 79-95 (2015) - [c1]César Covantes
, René Rodríguez
:
The Design of Multi-agent System for the Solution of School Timetabling Problem. MICAI (Special Sessions) 2015: 173-181
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 2025-02-25 23:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint