dela Cruz, Romar
Associate Professor
Research Interests
Error-correcting codes, Cryptography, Discrete Mathematics
Error-correcting codes, Cryptography, Discrete Mathematics
Academic Groups
- Coding and Number Theory (member)
-
Education
-
Ph.D. Mathematical Sciences (2013)
Nanyang Technological UniversityDissertation: On secret sharing schemes and linear codes
Adviser: Prof. Ling San, Prof. Wang Huaxiong and Dr. Patrick Sole -
M.S. Mathematics (2006)
University of the Philippines Diliman -
B.S. Mathematics (2001)
University of the Philippines Diliman
-
Ph.D. Mathematical Sciences (2013)
-
Postdoctoral Fellowships
-
Institute of Mathematics, University of Bayreuth (2019)
Supervisor: Prof. Alfred Wassermann
Project: Minimal codewords in linear codes
-
Institute of Mathematics, University of Bayreuth (2019)
-
Teaching
First Semester AY 2023-2024
Math 40
Math 197 – Introduction to Coding Theory
-
Publications
- R. dela Cruz, M. Kiermaier, S. Kurz and A. Wassermann, On the minimum number of minimal codewords, Advances in Mathematics of Communications, 2023.
- R. dela Cruz and S. Kurz, On the maximum number of minimal codewords, Discrete Mathematics, vol. 344, issue 9, 2021.
- R. dela Cruz and A. Wassermann, Majority Logic Decoding with Subspace Designs, IEEE Transactions on Information Theory, vol. 67, no. 1, pp. 179-186, January 2021.
- R. dela Cruz and S. OL, Cheating-Immune Secret Sharing Schemes from Maiorana-McFarland Boolean Functions, in Proceedings of ICISC 2018, Seoul, Korea, Lecture Notes in Computer Science, vol. 11396, 2019.
- H. Palines, S. Jitman and R. dela Cruz, Hermitian self-dual quasi-abelian codes, Journal of Algebra Combinatorics Discrete Structures and Applications, vol. 5, issue 1, pp. 5-18, 2018.
- S. Jitman, H. Palines and R. dela Cruz, On Quasi-Abelian Complementary Dual Codes, in Proceedings of the 5th International Castle Meeting on Coding Theory and Applications, Lecture Notes in Computer Science, vol. 10495, 2017.
- A. Alahmadi, R.E.L. Aldred, R. dela Cruz, S. Ok, P. Sole and C. Thomassen, The minimum number of minimal codewords in an \([n,k]\)-code, Discrete Applied Mathematics, vol. 184, pp. 32-39, 2015.
- Y. Gao and R. dela Cruz, Secret sharing schemes based on graphical codes, Cryptography and Communications, vol. 6, issue 2, pp. 137-155, June 2014.
- A. Alahmadi, R.E.L. Aldred, R. dela Cruz, P. Sole and C. Thomassen, The maximum number of minimal codewords in an \([n,k]\)-code, Discrete Mathematics, vol. 313, issue 15, pp. 1569-1574, August 6, 2013.
- R. dela Cruz and H. Wang, Cheating-immune secret sharing schemes from codes and cumulative arrays, Cryptography and Communications, vol. 5, issue 1, pp. 67-83, March 2013.
- A. Alahmadi, R.E.L. Aldred, R. dela Cruz, P. Sole and C. Thomassen, The maximum number of minimal codewords in long codes, Discrete Applied Mathematics, vol. 161, issue 3, pp. 424-429, February 2013.
- R. dela Cruz, A. Meyer and P. Sole, An extension of Massey scheme for secret sharing, Proceedings of IEEE Information Theory Workshop 2010, Dublin, Ireland, August 30 – September 3, 2010.