default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRomar dela Cruz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Romar dela Cruz, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
On the minimum number of minimal codewords. Adv. Math. Commun. 17(2): 333-341 (2023)- 2022
- [b1]Selda Çalkavur, Alexis Bonnecaze, Romar dela Cruz, Patrick Solé:
Code Based Secret Sharing Schemes - Applied Combinatorial Coding Theory. WorldScientific 2022, ISBN 9789811248320, pp. 1-212 - 2021
- [j7]Romar dela Cruz
, Sascha Kurz:
On the maximum number of minimal codewords. Discret. Math. 344(9): 112510 (2021) - [j6]Romar dela Cruz, Alfred Wassermann:
Majority Logic Decoding With Subspace Designs. IEEE Trans. Inf. Theory 67(1): 179-186 (2021) - 2020
- [i4]Romar dela Cruz, Sascha Kurz:
On the maximum number of minimal codewords. CoRR abs/2010.10762 (2020)
2010 – 2019
- 2018
- [c3]Romar B. dela Cruz, Say Ol:
Cheating-Immune Secret Sharing Schemes from Maiorana-McFarland Boolean Functions. ICISC 2018: 233-247 - 2017
- [c2]Somphong Jitman, Herbert S. Palines, Romar B. dela Cruz:
On Quasi-Abelian Complementary Dual Codes. ICMCTA 2017: 192-206 - 2015
- [j5]Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Seongmin Ok, Patrick Solé, Carsten Thomassen:
The minimum number of minimal codewords in an [n, k]-code and in graphic codes. Discret. Appl. Math. 184: 32-39 (2015) - 2014
- [j4]Ying Gao, Romar dela Cruz:
Secret sharing schemes based on graphical codes. Cryptogr. Commun. 6(2): 137-155 (2014) - 2013
- [j3]Romar dela Cruz, Huaxiong Wang:
Cheating-immune secret sharing schemes from codes and cumulative arrays. Cryptogr. Commun. 5(1): 67-83 (2013) - [j2]Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen:
The maximum number of minimal codewords in long codes. Discret. Appl. Math. 161(3): 424-429 (2013) - [j1]Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen:
The maximum number of minimal codewords in an [n, k][n, k]-code. Discret. Math. 313(15): 1569-1574 (2013) - 2012
- [i3]Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen:
The maximum number of minimal codewords in long codes. CoRR abs/1201.6043 (2012) - [i2]Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen:
The maximum number of minimal codewords in an $[n,k]-$code. CoRR abs/1203.0728 (2012) - 2010
- [c1]Romar dela Cruz, Annika Meyer, Patrick Solé:
An extension of Massey scheme for secret sharing. ITW 2010: 1-5 - [i1]Romar dela Cruz, Patrick Solé:
An extension of Massey scheme for secret sharing. CoRR abs/1004.2795 (2010)
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-04-25 05:47 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:
