Martianus Frederic Ezerman

Orcid: 0000-0002-5851-2717

Affiliations:
  • Nanyang Technological University, Singapore


According to our database1, Martianus Frederic Ezerman authored at least 59 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Constructing quantum error-correcting codes that require a variable amount of entanglement.
Quantum Inf. Process., January, 2024

Griesmer Bound and Constructions of Linear Codes in b-Symbol Metric.
CoRR, 2024

2023
A Construction of Maximum Distance Profile Convolutional Codes With Small Alphabet Sizes.
IEEE Trans. Inf. Theory, May, 2023

New Families of MDS Symbol-Pair Codes From Matrix-Product Codes.
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

Improved Spectral Bound for Quasi-Cyclic Codes.
CoRR, 2023

A Construction of Asymptotically Optimal Cascaded CDC Schemes via Combinatorial Designs.
CoRR, 2023

Sharper Asymptotically Optimal 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

On Propagation Rules for Entanglement-Assisted Quantum Codes.
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

Asymmetric quantum Griesmer codes detecting a single bit-flip error.
Discret. Math., 2022

How Much Entanglement Does a Quantum Code Need?
CoRR, 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

On greedy algorithms for binary de Bruijn sequences.
Appl. Algebra Eng. Commun. Comput., 2022

2021
A Comparison of Distance Bounds for Quasi-Twisted Codes.
IEEE Trans. Inf. Theory, 2021

Binary de Bruijn Sequences via Zech's Logarithms.
SN Comput. Sci., 2021

Patch-Based Holographic Image Sensing.
SIAM J. Imaging Sci., 2021

Generic Side-Channel Assisted Chosen-Ciphertext Attacks on Streamlined NTRU Prime.
IACR Cryptol. ePrint Arch., 2021

An efficiently generated family of binary de Bruijn sequences.
Discret. Math., 2021

Two new zero-dimensional qubit codes from bordered metacirculant construction.
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

Learning GANs in Simultaneous Game Using Sinkhorn With Positive Features.
IEEE Access, 2021

Convergence of Non-Convex Non-Concave GANs Using Sinkhorn Divergence.
IEEE Access, 2021

2020
Provably Secure Group Signature Schemes From Code-Based Assumptions.
IEEE Trans. Inf. Theory, 2020

Linear codes over 픽4R and their MacWilliams identity.
Discret. Math. Algorithms Appl., 2020

Quantum Error-Control Codes.
CoRR, 2020

A Graph Joining Greedy Approach to Binary de Bruijn Sequences.
CoRR, 2020

An Efficiently Generated Family of Binary de Bruijn Sequences.
CoRR, 2020

Holographic Image Sensing.
CoRR, 2020

2019
Double verification protocol via secret sharing for low-cost RFID tags.
Future Gener. Comput. Syst., 2019

On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials.
Des. Codes Cryptogr., 2019

General Criteria for Successor Rules to Efficiently Generate Binary de Bruijn Sequences.
CoRR, 2019

Good Stabilizer Codes from Quasi-Cyclic Codes over F<sub>4</sub> and F<sub>9</sub>.
CoRR, 2019

Spectral Bounds for Quasi-Twisted Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Good Stabilizer Codes from Quasi-Cyclic Codes over F4 and F9.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Skew Cyclic Codes Over F<sub>4</sub>R.
CoRR, 2018

Holographic Sensing.
CoRR, 2018

The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields.
Cryptogr. Commun., 2018

Construction of de Bruijn sequences from product of two irreducible polynomials.
Cryptogr. Commun., 2018

2017
Rates of DNA Sequence Profiles for Practical Values of Read Lengths.
IEEE Trans. Inf. Theory, 2017

Large Order Binary de Bruijn Sequences via Zech's Logarithms.
CoRR, 2017

2016
On the number of DNA sequence profiles for practical values of read lengths.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
On Polynomial Pairs of Integers.
J. Integer Seq., 2015

A Provably Secure Group Signature Scheme from Code-Based Assumptions.
IACR Cryptol. ePrint Arch., 2015

Xing-Ling codes, duals of their subcodes, and good asymmetric quantum codes.
Des. Codes Cryptogr., 2015

2013
CSS-Like Constructions of Asymmetric Quantum Codes.
IEEE Trans. Inf. Theory, 2013

Asymmetric quantum codes detecting a single amplitude error.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2011
Additive Asymmetric Quantum Codes.
IEEE Trans. Inf. Theory, 2011

The Weights in MDS Codes.
IEEE Trans. Inf. Theory, 2011

Nonbinary Quantum Codes from Two-Point Divisors on Hermitian Curves
CoRR, 2011

From skew-cyclic codes to asymmetric quantum codes.
Adv. Math. Commun., 2011

2010
On Asymmetric Quantum MDS Codes
CoRR, 2010


  Loading...