Martianus Frederic Ezerman
Orcid: 0000-0002-5851-2717Affiliations:
- Nanyang Technological University, Singapore
According to our database1,
Martianus Frederic Ezerman
authored at least 63 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
IEEE Trans. Inf. Theory, November, 2024
IEEE Trans. Inf. Theory, July, 2024
Constructing quantum error-correcting codes that require a variable amount of entanglement.
Quantum Inf. Process., January, 2024
Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes.
CoRR, 2024
Proceedings of the IEEE International Symposium on Information Theory, 2024
2023
A Construction of Maximum Distance Profile Convolutional Codes With Small Alphabet Sizes.
IEEE Trans. Inf. Theory, May, 2023
IEEE Trans. Inf. Theory, March, 2023
Three New Constructions of Optimal Locally Repairable Codes From Matrix-Product Codes.
IEEE Trans. Inf. Theory, 2023
Bounds and Constructions of Quantum Locally Recoverable Codes from Quantum CSS Codes.
CoRR, 2023
A Construction of Asymptotically Optimal Cascaded CDC Schemes via Combinatorial Designs.
CoRR, 2023
New quantum codes from metacirculant graphs via self-dual additive $\mathbb{F}_4$-codes.
Adv. Math. Commun., 2023
Four New Families of Quantum Stabilizer Codes from Hermitian Self-Orthogonal MDS codes.
Proceedings of the 12th International Symposium on Topics in Coding, 2023
Proceedings of the 12th International Symposium on Topics in Coding, 2023
2022
Will You Cross the Threshold for Me? Generic Side-Channel Assisted Chosen-Ciphertext Attacks on NTRU-based KEMs.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2022
Discret. Math., 2022
Entanglement-Assisted and Subsystem Quantum Codes: New Propagation Rules and Constructions.
CoRR, 2022
A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences.
CoRR, 2022
Two new classes of Hermitian self-orthogonal non-GRS MDS codes and their applications.
Adv. Math. Commun., 2022
Appl. Algebra Eng. Commun. Comput., 2022
2021
IEEE Trans. Inf. Theory, 2021
IACR Cryptol. ePrint Arch., 2021
Discret. Math., 2021
New Interleaving Constructions of Asymptotically Optimal Periodic Quasi-Complementary Sequence Sets.
CoRR, 2021
Three New Infinite Families of Optimal Locally Repairable Codes from Matrix-Product Codes.
CoRR, 2021
Improved Quantum Codes from Metacirculant Graphs via Self-Dual Additive F<sub>4</sub>-Codes.
CoRR, 2021
IEEE Access, 2021
IEEE Access, 2021
2020
IEEE Trans. Inf. Theory, 2020
Discret. Math. Algorithms Appl., 2020
2019
Future Gener. Comput. Syst., 2019
Des. Codes Cryptogr., 2019
General Criteria for Successor Rules to Efficiently Generate Binary de Bruijn Sequences.
CoRR, 2019
CoRR, 2019
Proceedings of the IEEE International Symposium on Information Theory, 2019
Proceedings of the IEEE International Symposium on Information Theory, 2019
2018
The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields.
Cryptogr. Commun., 2018
Cryptogr. Commun., 2018
2017
IEEE Trans. Inf. Theory, 2017
2016
Proceedings of the IEEE International Symposium on Information Theory, 2016
2015
IACR Cryptol. ePrint Arch., 2015
Des. Codes Cryptogr., 2015
2013
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013
2011
2010