75 citations · 172 across the 20 of their papers we have counts for
9 papers · 1 filter
The Tight Upper Bound for the Size of Single Deletion Error Correcting Codes in Dimension 11
Kazuhisa Nakasho, Manabu Hagiwara, Austin Anderson +1
A single deletion error correcting code (SDECC) is a set of fixed-length sequences consisting of two types of symbols, 0 and 1, such that the original sequence can be recovered for…
Quantum Deletion Codes derived from Classical Deletion Codes (Extended Abstract)
Manabu Hagiwara
This manuscript is an extended abstract version of the paper entitled ``Quantum Deletion Codes derived from Classical Deletion Codes.'' The paper contributes to the fundamental the…
Decoding algorithms of monotone codes and azinv codes and their unified view
Hokuto Takahashi, Manabu Hagiwara
This paper investigates linear-time decoding algorithms for two classes of error-correcting codes. One of the classes is monotone codes which are known as single deletion codes. Th…
Applications of Gaussian Binomials to Coding Theory for Deletion Error Correction
Manabu Hagiwara, Justin Kong
We present new applications on -binomials, also known as Gaussian binomial coefficients. Our main theorems determine cardinalities of certain error-correcting codes based on Var…
Multipermutation Ulam Sphere Analysis Toward Characterizing Maximal Code Size
Justin Kong, Manabu Hagiwara
Permutation codes, in the form of rank modulation, have shown promise for applications such as flash memory. One of the metrics recently suggested as appropriate for rank modulatio…
Linear Programming Upper Bounds on Permutation Code Sizes From Coherent Configurations Related to the Kendall Tau Distance Metric
Fabian Lim, Manabu Hagiwara
Recent interest on permutation rank modulation shows the Kendall tau metric as an important distance metric. This note documents our first efforts to obtain upper bounds on optimal…