default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenya Sugihara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j5]Seiji Okamoto, Kazushige Yonenaga, Kengo Horikoshi, Mitsuteru Yoshida, Yutaka Miyamoto, Masahito Tomizawa, Takeshi Okamoto, Hidemi Noguchi, Jun-ichi Abe, Junichiro Matsui, Hisao Nakashima, Yuichi Akiyama, Takeshi Hoshida
, Hiroshi Onaka, Kenya Sugihara, Soichiro Kametani, Kazuo Kubo, Takashi Sugihara:
400Gbit/s/ch Field Demonstration of Modulation Format Adaptation Based on Pilot-Aided OSNR Estimation Using Real-Time DSP. IEICE Trans. Commun. 100-B(10): 1726-1733 (2017)- [c7]Toshiaki Koike-Akino, Ye Wang, Stark C. Draper, Kenya Sugihara, Wataru Matsumoto:
Bit-interleaved polar-coded OFDM for low-latency M2M wireless communications. ICC 2017: 1-7 - [c6]Toshiaki Koike-Akino, Ye Wang, Stark C. Draper, Kenya Sugihara, Wataru Matsumoto, David S. Millar, Kieran Parsons, Keisuke Kojima:
Bit-interleaved polar-coded modulation for low-latency short-block transmission. OFC 2017: 1-3 - 2016
- [c5]Kenya Sugihara, Soichiro Kametani, Kazuo Kubo, Takashi Sugihara, Wataru Matsumoto:
A practicable rate-adaptive FEC scheme flexible about capacity and distance in optical transport networks. OFC 2016: 1-3 - 2015
- [c4]Kenji Ishii, Keisuke Dohi, Kazuo Kubo, Kenya Sugihara, Yoshikuni Miyata, Takashi Sugihara:
A study on power-scaling of triple-concatenated FEC for optical transport networks. ECOC 2015: 1-3 - [c3]Tian Xia, Toshiaki Koike-Akino, David S. Millar, Keisuke Kojima, Kieran Parsons, Yoshikuni Miyata, Kenya Sugihara, Wataru Matsumoto:
Dynamic window decoding for LDPC convolutional codes in low-latency optical communications. OFC 2015: 1-3 - 2013
- [c2]Kenya Sugihara, Yoshikuni Miyata, Takashi Sugihara, Kazuo Kubo, Hideo Yoshida, Wataru Matsumoto, Takashi Mizuochi:
A spatially-coupled type LDPC Code with an NCG of 12 dB for optical transmission beyond 100 Gb/s. OFC/NFOEC 2013: 1-3
2000 – 2009
- 2009
- [j4]Hiro Ito, Mike Paterson, Kenya Sugihara:
The Multi-Commodity Source Location Problems and the Price of Greed. J. Graph Algorithms Appl. 13(1): 55-73 (2009) - [j3]Kenya Sugihara, Hiro Ito:
Maximum-cover source location problems with objective edge-connectivity three. Math. Methods Oper. Res. 70(1): 183-193 (2009) - 2008
- [c1]Hiro Ito, Mike Paterson, Kenya Sugihara:
Multi-commodity Source Location Problems and Price of Greed. WALCOM 2008: 169-179 - 2006
- [j2]Kenya Sugihara, Hiro Ito:
Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three. Electron. Notes Discret. Math. 25: 165-171 (2006) - [j1]Kenya Sugihara, Hiro Ito:
Maximum-Cover Source-Location Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1370-1377 (2006)
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-09-28 01:30 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:
