Search Results - "Ezerman, Martianus Frederic"

Refine Results
  1. 1

    Three New Constructions of Optimal Locally Repairable Codes from Matrix-Product Codes by Luo, Gaojun, Ezerman, Martianus Frederic, Ling, San

    Published in IEEE transactions on information theory (01-01-2023)
    “…Locally repairable codes have become a key instrument in large-scale distributed storage systems. This paper focuses on the construction of locally repairable…”
    Get full text
    Journal Article
  2. 2

    On Linear Codes Whose Hermitian Hulls are MDS by Luo, Gaojun, Sok, Lin, Ezerman, Martianus Frederic, Ling, San

    Published in IEEE transactions on information theory (01-07-2024)
    “…Hermitian hulls of linear codes are interesting for theoretical and practical reasons alike. In terms of recent application, linear codes whose hulls meet…”
    Get full text
    Journal Article
  3. 3

    On the Weights of Linear Codes With Prescribed Automorphisms by Luo, Gaojun, Cao, Xiwang, Ezerman, Martianus Frederic, Ling, San

    Published in IEEE transactions on information theory (01-07-2024)
    “…The number of nonzero weights of a linear code is essential in coding theory as it unveils salient properties of the code, such as its covering radius. In this…”
    Get full text
    Journal Article
  4. 4

    Improved Spectral Bound for Quasi-Cyclic Codes by Luo, Gaojun, Ezerman, Martianus Frederic, Ling, San, Ozkaya, Buket

    Published in IEEE transactions on information theory (01-06-2024)
    “…Spectral bounds form a powerful tool to estimate the minimum distances of quasi-cyclic codes. They generalize the defining set bounds of cyclic codes to those…”
    Get full text
    Journal Article
  5. 5

    A Construction of Maximum Distance Profile Convolutional Codes with Small Alphabet Sizes by Luo, Gaojun, Cao, Xiwang, Ezerman, Martianus Frederic, Ling, San

    Published in IEEE transactions on information theory (01-05-2023)
    “…Convolutional codes are essential in a wide range of practical applications due to their efficient non-algebraic decoding algorithms. In this paper, we first…”
    Get full text
    Journal Article
  6. 6

    Provably Secure Group Signature Schemes From Code-Based Assumptions by Ezerman, Martianus Frederic, Lee, Hyung Tae, Ling, San, Nguyen, Khoa, Wang, Huaxiong

    Published in IEEE transactions on information theory (01-09-2020)
    “…We solve an open question in code-based cryptography by introducing two provably secure group signature schemes from code-based assumptions. Our basic scheme…”
    Get full text
    Journal Article
  7. 7

    New Families of MDS Symbol-Pair Codes From Matrix-Product Codes by Luo, Gaojun, Ezerman, Martianus Frederic, Ling, San, Pan, Xu

    Published in IEEE transactions on information theory (01-03-2023)
    “…In emerging storage technologies, the outputs of the channels consist of overlapping pairs of symbols. The errors are no longer individual symbols. Controlling…”
    Get full text
    Journal Article
  8. 8

    A Comparison of Distance Bounds for Quasi-Twisted Codes by Ezerman, Martianus Frederic, Lampos, John Mark, Ling, San, Ozkaya, Buket, Tharnnukhroh, Jareena

    Published in IEEE transactions on information theory (01-10-2021)
    “…Spectral bounds on the minimum distance of quasi-twisted codes over finite fields are proposed, based on eigenvalues of polynomial matrices and the…”
    Get full text
    Journal Article
  9. 9

    Rates of DNA Sequence Profiles for Practical Values of Read Lengths by Zuling Chang, Chrisnata, Johan, Ezerman, Martianus Frederic, Han Mao Kiah

    Published in IEEE transactions on information theory (01-11-2017)
    “…A recent study by one of the authors has demonstrated the importance of profile vectors in DNA-based data storage. We provide exact values and lower bounds on…”
    Get full text
    Journal Article
  10. 10

    On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials by Chang, Zuling, Ezerman, Martianus Frederic, Ling, San, Wang, Huaxiong

    Published in Designs, codes, and cryptography (15-05-2019)
    “…We propose a construction of de Bruijn sequences by the cycle joining method from linear feedback shift registers (LFSRs) with arbitrary characteristic…”
    Get full text
    Journal Article
  11. 11

    CSS-Like Constructions of Asymmetric Quantum Codes by Ezerman, Martianus Frederic, Jitman, Somphong, San Ling, Pasechnik, Dmitrii V.

    Published in IEEE transactions on information theory (01-10-2013)
    “…Asymmetric quantum error-correcting codes (AQCs) may offer some advantage over their symmetric counterparts by providing better error-correction for the more…”
    Get full text
    Journal Article
  12. 12

    The Weights in MDS Codes by Ezerman, M F, Grassl, M, Solé, P

    Published in IEEE transactions on information theory (01-01-2011)
    “…The weights in maximum distance separable (MDS) codes of length n and dimension k over the finite field GF(q) are studied. Up to some explicit exceptional…”
    Get full text
    Journal Article
  13. 13

    Additive Asymmetric Quantum Codes by Ezerman, M. F., San Ling, Sole, P.

    Published in IEEE transactions on information theory (01-08-2011)
    “…We present a general construction of asymmetric quantum codes based on additive codes under the trace Hermitian inner product. Various families of additive…”
    Get full text
    Journal Article
  14. 14

    A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences by Musthofa, Wijayanti, Indah Emilia, Palupi, Diah Junia Eksi, Ezerman, Martianus Frederic

    Published in Mathematics (Basel) (01-08-2022)
    “…A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn…”
    Get full text
    Journal Article
  15. 15

    Construction of de Bruijn sequences from product of two irreducible polynomials by Chang, Zuling, Ezerman, Martianus Frederic, Ling, San, Wang, Huaxiong

    Published in Cryptography and communications (01-03-2018)
    “…We study a class of Linear Feedback Shift Registers (LFSRs) with characteristic polynomial f ( x ) = p ( x ) q ( x ) where p ( x ) and q ( x ) are distinct…”
    Get full text
    Journal Article
  16. 16

    The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields by Chang, Zuling, Ezerman, Martianus Frederic, Ling, San, Wang, Huaxiong

    Published in Cryptography and communications (01-11-2018)
    “…We determine the cycle structure of linear feedback shift register with arbitrary monic characteristic polynomial over any finite field. For each cycle, a…”
    Get full text
    Journal Article
  17. 17

    Convergence of Non-Convex Non-Concave GANs Using Sinkhorn Divergence by Adnan, Risman, Saputra, Muchlisin Adi, Fadlil, Junaidillah, Ezerman, Martianus Frederic, Iqbal, Muhamad, Basaruddin, Tjan

    Published in IEEE access (2021)
    “…Sinkhorn divergence is a symmetric normalization of entropic regularized optimal transport. It is a smooth and continuous metrized weak-convergence with…”
    Get full text
    Journal Article
  18. 18

    Learning GANs in Simultaneous Game Using Sinkhorn With Positive Features by Adnan, Risman, Saputra, Muchlisin Adi, Fadlil, Junaidillah, Ezerman, Martianus Frederic, Iqbal, Muhamad, Basaruddin, Tjan

    Published in IEEE access (2021)
    “…Entropy regularized optimal transport (EOT) distance and its symmetric normalization, known as the Sinkhorn divergence, offer smooth and continuous metrized…”
    Get full text
    Journal Article
  19. 19

    On Propagation Rules for Entanglement-Assisted Quantum Codes by Luo, Gaojun, Sok, Lin, Ezerman, Martianus Frederic, Ling, San

    “…This paper proposes new propagation rules on quantum codes in the entanglement-assisted scenario. The rules lead to new families of such quantum codes whose…”
    Get full text
    Conference Proceeding
  20. 20

    Four New Families of Quantum Stabilizer Codes from Hermitian Self-Orthogonal MDS codes by Sok, Lin, Ezerman, Martianus Frederic, Ling, San

    “…We construct codes from rational function fields and provide sufficient conditions for a rational algebraic geometry code to be Hermitian self-orthogonal. A…”
    Get full text
    Conference Proceeding