Manabu Hagiwara

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., March, 2023

The Tight Upper Bound for the Size of Single Deletion Error Correcting Codes in Dimension 11.

[BibT_eX]

[DOI]

CoRR, 2023

Photoemission Orbital Tomography Using Robust Sparse PhaseLift.

[BibT_eX]

[DOI]

CoRR, 2023

Quantum Deletion Codes Derived From Quantum Reed-Solomon Codes.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Constructions of ℓ-Adic t-Deletion-Correcting Quantum Codes.

[BibT_eX]

[DOI]

Ryutaroh Matsumoto

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022

Decoding algorithms of monotone codes and azinv codes and their unified view.

[BibT_eX]

[DOI]

Hokuto Takahashi

Des. Codes Cryptogr., 2022

Quantum Deletion Codes derived from Classical Deletion Codes (Extended Abstract).

[BibT_eX]

[DOI]

CoRR, 2022

Equivalence of Quantum Single Insertion and Single Deletion Error-Correctabilities, and Construction of Codes and Decoders.

[BibT_eX]

[DOI]

Taro Shibayama

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Perfect Multi Deletion Codes Achieve the Asymptotic Optimality of Code Size.

[BibT_eX]

[DOI]

Takehiko Mori

IEEE Trans. Inf. Theory, 2021

A Survey of Quantum Error Correction.

[BibT_eX]

[DOI]

Ryutaroh Matsumoto

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Constructios of l-adic t-deletion-correcting quantum codes.

[BibT_eX]

[DOI]

Ryutaroh Matsumoto

CoRR, 2021

Permutation-Invariant Quantum Codes for Deletion Errors.

[BibT_eX]

[DOI]

Taro Shibayama

Proceedings of the IEEE International Symposium on Information Theory, 2021

Two Dimensional Deletion Correcting Codes and their Applications.

[BibT_eX]

[DOI]

Yeow Meng Chee

Van Khu Vu

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

A number theoretic formula and asymptotic optimality of cardinalities of BAD correcting codes.

[BibT_eX]

[DOI]

Takehiko Mori

Discret. Math., 2020

Single Quantum Deletion Error-Correcting Codes.

[BibT_eX]

[DOI]

Ayumu Nakayama

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Formalization of VT Codes and Their Single-Deletion Correcting Property in Lean.

[BibT_eX]

[DOI]

Yuki Kondo

Midori Kudo

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Conversion Method from Erasure Codes to Multi-Deletion Error-Correcting Codes for Information in Array Design.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

A Four-Qubits Code that is a Quantum Deletion Error-Correcting Code with the Optimal Length.

[BibT_eX]

[DOI]

Ayumu Nakayama

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Applications of Gaussian Binomials to Coding Theory for Deletion Error Correction.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Perfect Codes for Generalized Deletions from Minuscule Elements of Weyl Groups.

[BibT_eX]

[DOI]

CoRR, 2018

Cardinalities of BAD Correcting Codes.

[BibT_eX]

[DOI]

Takehiko Mori

Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Formalization of Insertion/Deletion Codes and the Levenshtein Metric in Lean.

[BibT_eX]

[DOI]

David J. Webb

Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Descent Moment Distributions for Permutation Deletion Codes via Levenshtein Codes.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Consolidation for compact constraints and Kendall tau LP decodable permutation codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2017

Multipermutation Ulam sphere analysis toward characterizing maximal code size.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Perfect codes for single balanced adjacent deletions.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Formalization of Bing's Shrinking Method in Geometric Topology.

[BibT_eX]

[DOI]

Ken'ichi Kuga

Mitsuharu Yamamoto

Proceedings of the Intelligent Computer Mathematics - 9th International Conference, 2016

Formalization of binary symmetric erasure channel based on infotheo.

[BibT_eX]

[DOI]

Kyosuke Nakano

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Nonexistence of perfect permutation codes in the Ulam metric.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Formalization of coding theory using lean.

[BibT_eX]

[DOI]

Kyosuke Nakano

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

On ordered syndromes for multi insertion/deletion error-correcting codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

A Deep Neural Network Architecture Using Dimensionality Reduction with Sparse Matrices.

[BibT_eX]

[DOI]

Proceedings of the Neural Information Processing - 23rd International Conference, 2016

2014

Formalization of Shannon's Theorems.

[BibT_eX]

[DOI]

Reynald Affeldt

Jonas Sénizergues

J. Autom. Reason., 2014

Formalization of the variable-length source coding theorem: Direct part.

[BibT_eX]

[DOI]

Ryosuke Obi

Reynald Affeldt

Proceedings of the International Symposium on Information Theory and its Applications, 2014

On the primitive polynomial as the characteristic polynomial of a symmetric companion matrix.

[BibT_eX]

[DOI]

Takaaki Sasaki

Proceedings of the International Symposium on Information Theory and its Applications, 2014

2012

LP-Decodable Permutation Codes Based on Linearly Constrained Permutation Matrices.

[BibT_eX]

[DOI]

Tadashi Wadayama

IEEE Trans. Inf. Theory, 2012

Quantum Error Correction Beyond the Bounded Distance Decoding Limit.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Fixed Initialization Decoding of LDPC Codes Over a Binary Symmetric Channel.

[BibT_eX]

[DOI]

Marc P. C. Fossorier

IEEE Trans. Inf. Theory, 2012

A Numerical Evaluation of Entanglement Sharing Protocols Using Quantum LDPC CSS Codes.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

Formalization of Shannon's Theorems in SSReflect-Coq.

[BibT_eX]

[DOI]

Reynald Affeldt

Proceedings of the Interactive Theorem Proving - Third International Conference, 2012

Comparing Euclidean, Kendall tau metrics toward extending LP decoding.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and its Applications, 2012

Weight enumerator analysis for (2, P)- and (3, P)-SFA LDPC codes.

[BibT_eX]

[DOI]

James B. Nation

Proceedings of the International Symposium on Information Theory and its Applications, 2012

Linear programming upper bounds on permutation code sizes from coherent configurations related to the Kendall-tau distance metric.

[BibT_eX]

[DOI]

Fabian Lim

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

On ML-certificate linear constraints for rank modulation with linear programming decoding and its application to compact graphs.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Non-binary quasi-cyclic quantum LDPC codes.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Spatially coupled quasi-cyclic quantum LDPC codes.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

LDPC codes with fixed initialization decoding over binary symmetric channel.

[BibT_eX]

[DOI]

Marc P. C. Fossorier

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Comment on "Quasi-Cyclic Low Density Parity Check Codes From Circulant Permutation Matrices".

[BibT_eX]

[DOI]

Marc P. C. Fossorier

IEEE Trans. Inf. Theory, 2009

An Efficient 2-Secure and Short Random Fingerprint Code and Its Security Evaluation.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

Smallest Size of Circulant Matrix for Regular (3, L) and (4, L) Quasi-Cyclic LDPC Codes with Girth 6.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

An improvement of discrete Tardos fingerprinting codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2009

Bounds on the Number of Users for Random 2-Secure Codes.

[BibT_eX]

[DOI]

Takahiro Yoshida

Proceedings of the Applied Algebra, 2009

2008

Error-correcting codes and cryptography.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2008

2007

Quantum Quasi-Cyclic LDPC Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Optimization of Tardos's Fingerprinting Codes in a Viewpoint of Memory Amount.

[BibT_eX]

[DOI]

Proceedings of the Information Hiding, 9th International Workshop, 2007

A Tracing Algorithm for Short 2-Secure Probabilistic Fingerprinting Codes Strongly Protecting Innocent Users.

[BibT_eX]

[DOI]

Proceedings of the 4th IEEE Consumer Communications and Networking Conference, 2007

On the Key-Privacy Issue of McEliece Public-Key Encryption.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2007

An Improvement of Tardos's Collusion-Secure Fingerprinting Codes with Very Short Lengths.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2007

2006

Optimal probabilistic fingerprinting codes using optimal finite random variables related to numerical quadrature

[BibT_eX]

[DOI]

CoRR, 2006

Unconditionally Secure Chaffing-and-Winnowing: A Relationship Between Encryption and Authentication.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2006

A Short Random Fingerprinting Code Against a Small Number of Pirates.

[BibT_eX]

[DOI]

Goichiro Hanaoka

Proceedings of the Applied Algebra, 2006

2004

Minuscule Heaps over Dynkin Diagrams of Type Ã.

[BibT_eX]

[DOI]