Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasakatu Morii
- > Home > Persons > Masakatu Morii
Publications
- 2020
[j58]Makoto Takita, Masanori Hirotomo, Masakatu Morii:
Coded Caching in Multi-Rate Wireless Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(12): 1347-1355 (2020)- 2019
- [c56]Yuki Ezawa, Makoto Takita, Yoshiaki Shiraishi, Shohei Kakei, Masanori Hirotomo, Youji Fukuta, Masami Mohri, Masakatu Morii:
Designing Authentication and Authorization System with Blockchain. AsiaJCIS 2019: 111-118 - [c55]Toshiki Tsuchida, Masanori Hirotomo, Haruka Ito, Makoto Takita, Yoshiaki Shiraishi, Kenta Nomura
, Masami Mohri, Youji Fukuta, Masakatu Morii:
A Signature Scheme Based on the Syndrome Decoding Problem Using LDPC Codes. AsiaJCIS 2019: 142-145 - 2018
- [j44]Makoto Takita, Masanori Hirotomo, Masakatu Morii:
Coded Caching for Hierarchical Networks with a Different Number of Layers. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2037-2046 (2018) - [c52]Makoto Takita, Masanori Hirotomo, Masakatu Morii:
Coded Caching in Multi-Rate Wireless Network. ICC Workshops 2018: 1-6 - [c51]Masanori Hirotomo, Hiroto Tamiya, Masakatu Morii:
Further Results on the Error Correction Capability of Irregular LDPC Codes under the Gallager A Algorithm. ISITA 2018: 203-207 - 2017
- [j36]Makoto Takita, Masanori Hirotomo, Masakatu Morii:
Error-Trapping Decoding for Cyclic Codes over Symbol-Pair Read Channels. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(12): 2578-2584 (2017) - [c44]Makoto Takita, Masanori Hirotomo, Masakatu Morii:
Coded Caching for Hierarchical Networks with a Different Number of Layers. CANDAR 2017: 249-255 - 2016
- [j31]Makoto Takita, Masanori Hirotomo, Masakatu Morii:
Algebraic Decoding of BCH Codes over Symbol-Pair Read Channels: Cases of Two-Pair and Three-Pair Error Correction. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(12): 2179-2191 (2016) - [c39]Masakatu Morii, Hiroto Tamiya, Masanori Hirotomo:
Error correction capability of irregular LDPC codes under the Gallager a algorithm. ISITA 2016: 586-590 - [c38]Masakatu Morii, Masanori Hirotomo, Makoto Takita:
Error-trapping decoding for cyclic codes over symbol-pair read channels. ISITA 2016: 681-685 - [c37]Kenta Kasai, Masanori Hirotomo, Masakatu Morii:
LDPC codes and iterative decoding over symbol-tuple error channels. ISTC 2016: 276-279 - 2015
- [j28]Makoto Takita, Masanori Hirotomo, Masakatu Morii:
A Decoding Algorithm for Cyclic Codes over Symbol-Pair Read Channels. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(12): 2415-2422 (2015) - [j27]Makoto Takita, Masanori Hirotomo, Masakatu Morii:
Syndrome Decoding of Symbol-Pair Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(12): 2423-2428 (2015) - 2014
- [j25]Masanori Hirotomo, Masakatu Morii:
A Method for Computing the Weight Spectrum of LDPC Convolutional Codes Based on Circulant Matrices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(12): 2300-2308 (2014) - [c29]Masanori Hirotomo, Jun'ichi Tsurumi, Masakatu Morii:
On computing the weight distribution of non-binary ldpc codes using the probabilistic algorithm. ISITA 2014: 11-15 - [c28]Masanori Hirotomo, Makoto Takita, Masakatu Morii:
Syndrome decoding of symbol-pair codes. ITW 2014: 162-166 - 2012
- [j21]Masanori Hirotomo, Masami Mohri, Masakatu Morii:
On the Probabilistic Computation Method with Reliability for the Weight Distribution of LDPC Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(4): 790-800 (2012) - [c23]Masanori Hirotomo, Masakatu Morii:
An efficient method for computing the weight spectrum of LDPC convolutional codes constructed from quasi-cyclic codes. ISITA 2012: 551-555 - 2011
- [j18]Yuko Ozasa, Masanori Hirotomo, Masakatu Morii:
Irreducible m-Term Polynomial and Its Application to Multiplication over GF(2m). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(3): 1045-1048 (2011) - [c21]Masanori Hirotomo, Masami Mohri, Masakatu Morii:
A reliability-based computation method for the weight distribution of LDPC codes using the probabilistic algorithm. ISIT 2011: 361-365 - 2010
- [c19]Masanori Hirotomo, Masakatu Morii:
Detailed evaluation of error floors of LDPC codes using the probabilistic algorithm. ISITA 2010: 513-518 - 2009
- [j13]Masanori Hirotomo, Masami Mohri, Masakatu Morii:
A Probabilistic Algorithm for Computing the Weight Distribution of LDPC Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(7): 1677-1689 (2009) - [c17]Masanori Hirotomo, Yoshiho Konishi, Masakatu Morii:
On the probabilistic computation of the stopping redundancy of LDPC codes. ISIT 2009: 234-238 - 2008
- [c13]Masanori Hirotomo, Yoshiho Konishi, Masakatu Morii:
On the probabilistic computation algorithm for the minimum-size stopping sets of LDPC codes. ISIT 2008: 295-299 - [c12]Masanori Hirotomo, Yoshiho Konishi, Masakatu Morii:
A probabilistic algorithm for finding the minimum-size stopping sets of LDPC codes. ITW 2008: 66-70 - 2005
- [c6]Masanori Hirotomo, Masanori Mohri, Masakatu Morii:
A probabilistic computation method for the weight distribution of low-density parity-check codes. ISIT 2005: 2166-2170
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-02-19 20:10 CET 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:
