![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Mitsuru Hamada
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c7]Tomonori Nakahara, Kohei Fukuyama, Mitsuru Hamada, Kenji Matsui, Yoshihisa Nakatoh, Yumiko O. Kato, Alberto Rivas, Juan Manuel Corchado:
Mobile Device-Based Speech Enhancement System Using Lip-Reading. DCAI 2020: 159-167
2010 – 2019
- 2016
- [c6]Keishi Yamaguchi, Mitsuru Hamada, Duc Khai Lam
, Nico Surantha
, Yuhei Nagao, Masayuki Kurosaki, Hiroshi Ochi:
A secure and fast industrial WLAN system with zero-delay roaming. ICIT 2016: 812-817 - [c5]Khairunisa Ahmad Denney, Mitsuru Hamada, Yuhei Nagao, Masayuki Kurosaki, Hiroshi Ochi:
ToA-based positioning system for industrial wireless LAN. ISPACS 2016: 1-5 - 2010
- [c4]Mitsuru Hamada:
Security of concatenated encoders for wiretap channels. ISIT 2010: 2558-2562 - [i2]Mitsuru Hamada:
An Exposition of a Result in "Conjugate Codes for Secure and Reliable Information Transmission". CoRR abs/1001.1806 (2010)
2000 – 2009
- 2009
- [c3]Mitsuru Hamada:
A polynomial-time construction of self-orthogonal codes and applications to quantum error correction. ISIT 2009: 794-798 - 2008
- [j6]Mitsuru Hamada:
Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction. IEEE Trans. Inf. Theory 54(12): 5689-5704 (2008) - 2007
- [i1]Mitsuru Hamada:
Constructive Conjugate Codes for Quantum Error Correction and Cryptography. CoRR abs/cs/0703141 (2007) - 2005
- [j5]Mitsuru Hamada:
Information rates achievable with algebraic codes on quantum discrete memoryless channels. IEEE Trans. Inf. Theory 51(12): 4263-4277 (2005) - 2004
- [c2]Mitsuru Hamada:
Reliability of Calderbank-Shor-Steane codes and security of quantum key distribution. ISIT 2004: 138 - 2002
- [j4]Mitsuru Hamada:
Lower bounds on the quantum capacity and highest error exponent of general memoryless channels. IEEE Trans. Inf. Theory 48(9): 2547-2557 (2002) - 2001
- [j3]Mitsuru Hamada:
The burst weight distributions of maximum-hamming-distance-separable codes. IEEE Trans. Inf. Theory 47(1): 404-406 (2001)
1990 – 1999
- 1999
- [j2]Te Sun Han, Mitsuru Hamada:
Disjointness of Random Sequence Sets with Respect to Distinct Probability Measures. IEEE Trans. Inf. Theory 45(2): 756-760 (1999) - 1997
- [j1]Mitsuru Hamada, Eiji Fujiwara:
A Class of Error Control Codes for Byte Organized Memory Systems -SbEC-(Sb+S)ED Codes-. IEEE Trans. Computers 46(1): 105-109 (1997) - 1992
- [c1]Eiji Fujiwara, Mitsuru Hamada:
Single b-Bit Byte Error Correcting and Double Bit Error Detecting Codes for High-Speed Memory Systems. FTCS 1992: 494-501
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint