2 citations · 2 across the 4 of their papers we have counts for
4 papers
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…
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…
On ML-Certificate Linear Constraints for Rank Modulation with Linear Programming Decoding and its Application to Compact Graphs
Manabu Hagiwara
Linear constraints for a matrix polytope with no fractional vertex are investigated as intersecting research among permutation codes, rank modulations, and linear programming metho…