default search action
Tomoharu Shibuya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Daisuke Hibino, Tomoharu Shibuya:
Efficient Construction of Encoding Polynomials in a Distributed Coded Computing Scheme. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(3): 476-485 (2024) - 2020
- [j18]Mariko Fujii, Tomoharu Shibuya:
Improvement of the Quality of Visual Secret Sharing Schemes with Constraints on the Usage of Shares. IEICE Trans. Inf. Syst. 103-D(1): 11-24 (2020)
2010 – 2019
- 2017
- [j17]Tomoharu Shibuya, Takeru Sudo:
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. 100-A(12): 2558-2571 (2017) - 2016
- [c14]Tomoharu Shibuya, Takeru Sudo:
Construction and analysis of rank-modulation rewriting codes by the group of permutation matrices. ISITA 2016: 131-135 - 2014
- [j16]Tomoharu Shibuya, Kazuki Kobayashi:
Efficient Linear Time Encoding for LDPC Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(7): 1556-1567 (2014) - [j15]Keisuke Kodaira, Mihoko Wada, Tomoharu Shibuya:
Single Error Correcting Quantum Codes for the Amplitude Damping Channel Based on Classical Codes over GF(7). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(11): 2247-2253 (2014) - [c13]Mihoko Wada, Keisuke Kodaira, Tomoharu Shibuya:
Entanglement-assisted quantum error-correcting codes based on the circulant permutation matrix. ISITA 2014: 158-162 - [c12]Keisuke Kodaira, Tomoharu Shibuya:
On the condition on classical codes to construct quantum error correcting codes for amplitude damping channel. ISITA 2014: 167-171 - 2013
- [j14]Hiroyuki Ihara, Tomoharu Shibuya:
On the Dependence of Error Performance of Spatially Coupled LDPC Codes on Their Design Parameters. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(12): 2447-2451 (2013) - 2012
- [c11]Kazuki Kobayashi, Tomoharu Shibuya:
Generalization of Lu's linear time encoding algorithm for LDPC codes. ISITA 2012: 16-20 - 2011
- [j13]Tomoharu Shibuya:
Ring Theoretic Approach to Reversible Codes Based on Circulant Matrices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(11): 2121-2126 (2011) - [c10]Tomoharu Shibuya:
Block-triangularization of parity check matrices for efficient encoding of linear codes. ISIT 2011: 533-537 - 2010
- [j12]Tomoharu Shibuya:
Characterization of Factor Graph by Mooij's Sufficient Condition for Convergence of the Sum-Product Algorithm. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(11): 2083-2088 (2010)
2000 – 2009
- 2008
- [j11]Takayuki Nozaki
, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa:
Detailed Evolution of Degree Distributions in Residual Graphs with Joint Degree Distributions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(10): 2737-2744 (2008) - [c9]Ryuhei Mori
Asymptotic bit error probability of LDPC codes for the binary erasure channel with finite number of iterations. ISIT 2008: 449-453 - [c8]Tsuyoshi Nakasendo, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa:
Two-edge type LDPC code ensembles with exponentially few codewords with linear small weight. ISIT 2008: 1138-1142 - [c7]Takayuki Nozaki
Detailed evolution of degree distributions in residual graphs with joint degree distributions. ISIT 2008: 1438-1442 - [i1]Ryuhei Mori, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa:
The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number. CoRR abs/0801.0931 (2008) - 2007
- [j10]Ryoji Ikegaya, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa:
Performance of Standard Irregular LDPC Codes under Maximum Likelihood Decoding. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(7): 1432-1443 (2007) - [j9]Takayuki Itsui, Kenta Kasai, Ryoji Ikegaya, Tomoharu Shibuya, Kohichi Sakaniwa:
Average Bit Erasure Probability of Regular LDPC Code Ensembles under MAP Decoding over BEC. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(9): 1763-1771 (2007) - [c6]Shinya Miyamoto, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa:
Tight Bounds of Minimum Distance Distributions of Irregular LDPC Code Ensembles. ISIT 2007: 756-760 - 2006
- [j8]Kenta Kasai, Yuji Shimoyama, Tomoharu Shibuya, Kohichi Sakaniwa:
Average Coset Weight Distribution of Multi-Edge Type LDPC Code Ensembles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(10): 2519-2525 (2006) - [j7]Kenta Kasai, Shinya Miyamoto, Tomoharu Shibuya, Kohichi Sakaniwa:
Design of Irregular Repeat Accumulate Codes with Joint Degree Distributions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(11): 3351-3354 (2006) - [c5]Takayuki Itsui, Kenta Kasai, Ryoji Ikegaya, Tomoharu Shibuya, Kohichi Sakaniwa:
Second Support Weight Distribution of Regular LDPC Code Ensembles. ISIT 2006: 2879-2883 - [c4]Ryoji Ikegaya, Kenta Kasai, Tomoharu Shibuya, Koichi Sakaniwa:
The Block Error Probability of Detailedly Represented Irregular LDPC Code Ensembles under Maximum Likelihood Decoding. ITW 2006: 317-321 - 2005
- [j6]Tomoharu Shibuya, Ken Harada, Ryosuke Tohyama, Kohichi Sakaniwa:
Iterative Decoding Based on the Concave-Convex Procedure. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1346-1364 (2005) - [j5]Ryoji Ikegaya, Kenta Kasai, Yuji Shimoyama, Tomoharu Shibuya, Kohichi Sakaniwa:
Weight and Stopping Set Distributions of Two-Edge Type LDPC Code Ensembles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(10): 2745-2761 (2005) - [c3]Ryoji Ikegaya, Kenta Kasai, Yuji Shimoyama, Tomoharu Shibuya, Kohichi Sakaniwa:
Stopping set distributions of two-edge type LDPC code ensembles. ISIT 2005: 985-989 - 2004
- [c2]Ryoji Ikegaya, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa:
Asymptotic weight and stopping set distributions for detailedly represented irregular LDPC code ensembles. ISIT 2004: 208 - 2003
- [j4]Tomoharu Shibuya, Kohichi Sakaniwa:
Construction of Cyclic Codes Suitable for Iterative Decoding via Generating Idempotents. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(4): 928-939 (2003) - [j3]Tomoharu Shibuya, Masatoshi Onikubo, Kohichi Sakaniwa:
On Tanner's Lower Bound for the Minimum Distance of Regular LDPC Codes Based on Combinatorial Designs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(10): 2428-2434 (2003) - [j2]Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa:
Detailedly Represented Irregular Low-Density Parity-Check Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(10): 2435-2444 (2003) - [j1]Tomoharu Shibuya, Kohichi Sakaniwa:
Performance of a Decoding Algorithm for LDPC Codes Based on the Concave-Convex Procedure. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(10): 2601-2606 (2003)
1990 – 1999
- 1997
- [c1]Tomoharu Shibuya, Jiro Mizutani, Kohichi Sakaniwa:
On Generalized Hamming Weights of Codes Constructed on Affine Algebraic Sets. AAECC 1997: 311-320
Coauthor Index
aka: Koichi Sakaniwa
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: