1 citations · 1 across the 6 of their papers we have counts for
7 papers
Lower Bounds on Pauli Manipulation Detection Codes
Keiya Ichikawa, Kenji Yasunaga
We present a lower bound for Pauli Manipulation Detection (PMD) codes, a class of quantum codes that detect every Pauli error with high probability. Our lower bound reveals the fir…
Improved Bounds for Codes Correcting Insertions and Deletions
Kenji Yasunaga
This paper studies the cardinality of codes correcting insertions and deletions. We give improved upper and lower bounds on code size. Our upper bound is obtained by utilizing the…
Perfectly Secure Message Transmission against Rational Adversaries
Maiki Fujita, Takeshi Koshiba, Kenji Yasunaga
Secure Message Transmission (SMT) is a two-party cryptographic protocol by which the sender can securely and reliably transmit messages to the receiver using multiple channels. An…
On the List Decodability of Insertions and Deletions
Tomohiro Hayashi, Kenji Yasunaga
In this work, we study the problem of list decoding of insertions and deletions. We present a Johnson-type upper bound on the maximum list size. The bound is meaningful only when i…
Error Correction by Structural Simplicity: Correcting Samplable Additive Errors
Kenji Yasunaga
This paper explores the possibilities and limitations of error correction by the structural simplicity of error mechanisms. Specifically, we consider channel models, called \emph{s…
Uncorrectable Errors of Weight Half the Minimum Distance for Binary Linear Codes
Kenji Yasunaga, Toru Fujiwara
A lower bound on the number of uncorrectable errors of weight half the minimum distance is derived for binary linear codes satisfying some condition. The condition is satisfied by…