default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMotohiko Isaka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Ken Hisanaga, Motohiko Isaka:
Communication-Efficient Distributed Orthogonal Approximate Message Passing for Sparse Signal Recovery. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(3): 493-502 (2024)- 2022
- [j18]Takayuki Nozaki, Motohiko Isaka:
LDPC Codes for Communication Systems: Coding Theoretic Perspective. IEICE Trans. Commun. 105-B(8): 894-905 (2022) - [c12]Kazuki Ogawa, Hiromu Takata, Motohiko Isaka:
Lossy Source Coding of Binary Memoryless Source by Trained LDGM Encoder. ISITA 2022: 249-253
2010 – 2019
- 2019
- [j17]Shungo Miyagi, Motohiko Isaka:
Ternary Convolutional Codes with Optimum Distance Spectrum. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(12): 1688-1690 (2019) - 2018
- [j16]Junya Hiramatsu, Motohiko Isaka:
Lossy Source Coding for Non-Uniform Binary Source with Trellis Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(2): 531-534 (2018) - [j15]Hironori Soen, Motohiko Isaka:
Error Performance Analysis of Network Coded Cooperation for Gaussian Relay Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2026-2036 (2018) - [c11]Motohiko Isaka:
Expected Error Rate of Probabilistic Network Codes over Gaussian Relay Network. ISITA 2018: 90-94 - 2016
- [j14]Motohiko Isaka:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(12): 2106 (2016) - 2015
- [j13]Kana Deguchi, Motohiko Isaka:
Error Performance Analysis of Asymmetric Slepian-Wolf Coding for Ordered Random Variables. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(4): 992-999 (2015) - [j12]Yohei Onishi, Hidaka Kinugasa, Takashi Muraki, Motohiko Isaka:
Rate-Distortion Performance of Convolutional Codes for Binary Symmetric Source. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(12): 2480-2482 (2015) - [c10]Kana Deguchi, Motohiko Isaka:
Approximate performance bound for coding in secret key agreement from the Gaussian channel. WCNC 2015: 458-463 - 2014
- [c9]Kana Deguchi, Motohiko Isaka:
Analysis of Information Reconciliation in Secret Key Agreement from the AWGN Channel. VTC Spring 2014: 1-5 - 2012
- [j11]Misako Kotani, Shingo Kawamoto, Motohiko Isaka:
Granular Gain of Low-Dimensional Lattices from Binary Linear Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(12): 2168-2170 (2012) - [c8]Satoru Nakagawa, Motohiko Isaka:
Non-binary serially concatenated codes for distributed source coding. ISITA 2012: 56-60 - 2011
- [j10]Motohiko Isaka, Seiya Kawata:
Signal Sets for Secret Key Agreement With Public Discussion Based on Gaussian and Fading Channels. IEEE Trans. Inf. Forensics Secur. 6(3-1): 523-531 (2011) - 2010
- [j9]Motohiko Isaka:
Oblivious Transfer from the Additive White Gaussian Noise Channel. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(2): 516-525 (2010) - [j8]Motohiko Isaka:
Unconditionally Secure Oblivious Transfer from Algebraic Signaling over the Gaussian Channel. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(11): 2017-2025 (2010) - [j7]Misako Kotani, Motohiko Isaka:
Lossy Coding of Binary Sources with Short Linear Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(11): 2074-2076 (2010) - [c7]Motohiko Isaka:
On unconditionally secure oblivious transfer from continuous channels. ISIT 2010: 2617-2621 - [c6]Shohei Iwata, Toshihiro Hattori, Motohiko Isaka:
On coding for nonbinary sources with side information at the decoder. ISITA 2010: 88-93
2000 – 2009
- 2009
- [c5]Motohiko Isaka:
Efficient oblivious transfer from algebraic signaling over the Gaussian channel. ISIT 2009: 1293-1297 - [c4]Motohiko Isaka, Seiya Kawata:
On secret key agreement from the additive white Gaussian noise channel. PIMRC 2009: 2171-2175 - 2008
- [c3]Motohiko Isaka, Yuki Shimizu:
Cryptographic primitives based on discrete-input AWGN channels. ISIT 2008: 737-741 - 2007
- [j6]Motohiko Isaka, Philippa A. Martin
, Marc P. C. Fossorier:
Design of High-Rate Serially Concatenated Codes with Low Error Floor. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(9): 1754-1762 (2007) - 2005
- [j5]Motohiko Isaka, Marc P. C. Fossorier:
Iterative reliability-based decoding in bandwidth efficient coding schemes. Ann. des Télécommunications 60(1-2): 132-146 (2005) - [j4]Motohiko Isaka, Marc P. C. Fossorier:
High-rate serially concatenated coding with extended Hamming codes. IEEE Commun. Lett. 9(2): 160-162 (2005) - [c2]Motohiko Isaka:
High-rate serially concatenated codes using Hamming codes. ICC 2005: 637-641 - 2004
- [j3]Motohiko Isaka, Marc P. C. Fossorier, Hideki Imai:
On the suboptimality of iterative decoding for turbo-like and LDPC codes with cycles in their graph representation. IEEE Trans. Commun. 52(5): 845-854 (2004) - 2002
- [c1]Motohiko Isaka, Marc P. C. Fossorier, Hideki Imai:
Iterative reliability-based decoding of turbo-like codes. ICC 2002: 1495-1500 - 2001
- [j2]Motohiko Isaka, Hideki Imai:
On the iterative decoding of multilevel codes. IEEE J. Sel. Areas Commun. 19(5): 935-943 (2001) - 2000
- [j1]Motohiko Isaka, Marc P. C. Fossorier, Robert Morelos-Zaragoza, Shu Lin, Hideki Imai:
Multilevel coded modulation for unequal error protection and multistage decoding. II. Asymmetric constellations. IEEE Trans. Commun. 48(5): 774-786 (2000)
Coauthor Index
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-10-17 20:32 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:
