Countries citing papers authored by Kohichi Sakaniwa
Since
Specialization
Citations
This map shows the geographic impact of Kohichi Sakaniwa's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Kohichi Sakaniwa with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kohichi Sakaniwa more than expected).
Fields of papers citing papers by Kohichi Sakaniwa
This network shows the impact of papers produced by Kohichi Sakaniwa. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Kohichi Sakaniwa. The network helps show where Kohichi Sakaniwa may publish in the future.
Co-authorship network of co-authors of Kohichi Sakaniwa
This figure shows the co-authorship network connecting the top 25 collaborators of Kohichi Sakaniwa.
A scholar is included among the top collaborators of Kohichi Sakaniwa based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Kohichi Sakaniwa. Kohichi Sakaniwa is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Kasai, Kenta, et al.. (2006). Upper Bounds of Block Error Probability of Standard Irregular LDPC Code Ensemble under Maximum Likelihood Decoding. 1–6.1 indexed citations
9.
Kasai, Kenta, et al.. (2005). Average Error Probability of Standard Irregular LDPC Code Ensemble under Maximum Likelihood Decoding. Tokyo Tech Research Repository (Tokyo Institute of Technology). 28(1). 115–118.1 indexed citations
10.
Furukawa, Toshihiro, et al.. (2004). A practical subspace blind identification algorithm with reduced computational complexity. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 87(12). 3360–3371.
11.
Sakaniwa, Kohichi, et al.. (2004). Modified Low Density MDS Array Codes for RAID and Memory Systems. 27(1). 87–90.1 indexed citations
12.
Sakaniwa, Kohichi, et al.. (2003). Performance of a decoding algorithm for LDPC codes based on the concave-convex procedure. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 86(10). 2601–2606.1 indexed citations
13.
Sakaniwa, Kohichi, et al.. (2003). Construction of Cyclic Codes Suitable for Iterative Decoding via Generating Idempotents. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 86(4). 928–939.10 indexed citations
14.
Kasai, Kenta, et al.. (2003). Detailedly Represented Irregular Low-Density Parity-Check Codes ∗. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 86(10). 2435–2444.15 indexed citations
Matsumoto, Ryutaroh, et al.. (2001). Fast Encoding of Algebraic Geometry Codes. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 84(10). 2514–2517.3 indexed citations
17.
Sakaniwa, Kohichi, et al.. (2001). Factor graphs for cyclic codes with no cycles of length four. Tokyo Tech Research Repository (Tokyo Institute of Technology). 24(1). 3–6.1 indexed citations
18.
Sakaniwa, Kohichi, et al.. (2001). A Note on a Lower Bound for Generalized Hamming Weights. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 84(12). 3138–3145.2 indexed citations
19.
Hasegawa, Ryô, et al.. (1999). A Lower Bound for Generalized Hamming Weights and a Condition for t-th Rank MDS ∗. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 82(6). 1090–1101.4 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.