Tomoharu Shibuya

According to our database1, Tomoharu Shibuya authored at least 33 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient Construction of Encoding Polynomials in a Distributed Coded Computing Scheme.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024

2020
Improvement of the Quality of Visual Secret Sharing Schemes with Constraints on the Usage of Shares.
IEICE Trans. Inf. Syst., 2020

2017
On a Characterization of a State of Rank-Modulation Scheme Over Multi-Cell Ranking by a Group Action.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

2016
Construction and analysis of rank-modulation rewriting codes by the group of permutation matrices.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

2014
Efficient Linear Time Encoding for LDPC Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Single Error Correcting Quantum Codes for the Amplitude Damping Channel Based on Classical Codes over <i>GF</i>(7).
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Entanglement-assisted quantum error-correcting codes based on the circulant permutation matrix.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

On the condition on classical codes to construct quantum error correcting codes for amplitude damping channel.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

2013
On the Dependence of Error Performance of Spatially Coupled LDPC Codes on Their Design Parameters.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

2012
Generalization of Lu's linear time encoding algorithm for LDPC codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

2011
Ring Theoretic Approach to Reversible Codes Based on Circulant Matrices.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

Block-triangularization of parity check matrices for efficient encoding of linear codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Characterization of Factor Graph by Mooij's Sufficient Condition for Convergence of the Sum-Product Algorithm.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

2008
Detailed Evolution of Degree Distributions in Residual Graphs with Joint Degree Distributions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number
CoRR, 2008

Two-edge type LDPC code ensembles with exponentially few codewords with linear small weight.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Asymptotic bit error probability of LDPC codes for the binary erasure channel with finite number of iterations.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Average Bit Erasure Probability of Regular LDPC Code Ensembles under MAP Decoding over BEC.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

Performance of Standard Irregular LDPC Codes under Maximum Likelihood Decoding.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

Tight Bounds of Minimum Distance Distributions of Irregular LDPC Code Ensembles.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Average Coset Weight Distribution of Multi-Edge Type LDPC Code Ensembles.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Design of Irregular Repeat Accumulate Codes with Joint Degree Distributions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

The Block Error Probability of Detailedly Represented Irregular LDPC Code Ensembles under Maximum Likelihood Decoding.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Second Support Weight Distribution of Regular LDPC Code Ensembles.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Iterative Decoding Based on the Concave-Convex Procedure.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Weight and Stopping Set Distributions of Two-Edge Type LDPC Code Ensembles.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Stopping set distributions of two-edge type LDPC code ensembles.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Asymptotic weight and stopping set distributions for detailedly represented irregular LDPC code ensembles.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Performance of a Decoding Algorithm for LDPC Codes Based on the Concave-Convex Procedure.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

Construction of Cyclic Codes Suitable for Iterative Decoding via Generating Idempotents.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

On Tanner's Lower Bound for the Minimum Distance of Regular LDPC Codes Based on Combinatorial Designs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

Detailedly Represented Irregular Low-Density Parity-Check Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

1997
On Generalized Hamming Weights of Codes Constructed on Affine Algebraic Sets.
Proceedings of the Applied Algebra, 1997


  Loading...