Romar dela Cruz

Orcid: 0000-0003-3563-2262

According to our database1, Romar dela Cruz authored at least 14 papers between 2010 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On the minimum number of minimal codewords.
Adv. Math. Commun., 2023

2022
Code Based Secret Sharing Schemes - Applied Combinatorial Coding Theory
WorldScientific, ISBN: 9789811248344, 2022

2021
Majority Logic Decoding With Subspace Designs.
IEEE Trans. Inf. Theory, 2021

On the maximum number of minimal codewords.
Discret. Math., 2021

2018
Cheating-Immune Secret Sharing Schemes from Maiorana-McFarland Boolean Functions.
Proceedings of the Information Security and Cryptology - ICISC 2018, 2018

2017
On Quasi-Abelian Complementary Dual Codes.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2015
The minimum number of minimal codewords in an [n, k]-code and in graphic codes.
Discret. Appl. Math., 2015

2014
Secret sharing schemes based on graphical codes.
Cryptogr. Commun., 2014

2013
The maximum number of minimal codewords in an [<i>n</i>, <i>k</i>][n, k]-code.
Discret. Math., 2013

The maximum number of minimal codewords in long codes.
Discret. Appl. Math., 2013

Cheating-immune secret sharing schemes from codes and cumulative arrays.
Cryptogr. Commun., 2013

2012
The maximum number of minimal codewords in an $[n,k]-$code
CoRR, 2012

2010
An extension of Massey scheme for secret sharing
CoRR, 2010

An extension of Massey scheme for secret sharing.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010


  Loading...