Toshinobu Kaneko

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Satoshi Gounai

> Home > Persons > Toshinobu Kaneko

Publications

2008
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/ieicet/GounaiOK08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/GounaiOK08
Satoshi Gounai, Tomoaki Ohtsuki, Toshinobu Kaneko:
Mapping for Iterative MMSE-SIC with Belief Propagation. IEICE Trans. Commun. 91-B(7): 2187-2197 (2008)
2007
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/ieicet/GounaiOK07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/GounaiOK07
Satoshi Gounai, Tomoaki Ohtsuki, Toshinobu Kaneko:
Lowering the Error Floors of Irregular LDPC Code on Fast Fading Environment with Perfect and Imperfect CSIs. IEICE Trans. Commun. 90-B(3): 569-577 (2007)
2006
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/icc/GounaiOK06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icc/GounaiOK06
Satoshi Gounai, Tomoaki Ohtsuki, Toshinobu Kaneko:
Performance of Concatenated Code with LDPC Code and RSC Code. ICC 2006: 1195-1199
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/vtc/GounaiOK06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/vtc/GounaiOK06
Satoshi Gounai, Tomoaki Ohtsuki, Toshinobu Kaneko:
Modified Belief Propagation Decoding Algorithm for Low-Density Parity Check Code Based on Oscillation. VTC Spring 2006: 1467-1471

a service of

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.