○○学科

細谷 剛

ホソヤ ゴウ  (Gou Hosoya)

基本情報

所属
大阪産業大学 工学部 准教授
学位
博士(工学)(2008年12月 早稲田大学)

J-GLOBAL ID
200901046693783710
researchmap会員ID
6000009493

外部リンク

研究キーワード

 1

論文

 70
  • G. Hosoya
    Proc. 2022 International Symposium on Information Theory (ISIT2022) 3127-3132 2022年6月  査読有り筆頭著者
  • G. Hosoya
    Proc. of 2021 20th International Symposium on Communications and Information Technologies (ISCIT) 193-198 2021年10月  査読有り筆頭著者
  • Ryo Shibata, Gou Hosoya, Hiroyuki Yashima
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 103(11) 1283-1291 2020年11月  
    Copyright © 2020 The Institute of Electronics, Information and Communication Engineers. We propose a coding/decoding strategy that surpasses the symmetric information rate of a binary insertion/deletion (ID) channel and approaches the Markov capacity of the channel. The proposed codes comprise inner trellis codes and outer irregular low-density parity-check (LDPC) codes. The trellis codes are designed to mimic the transition probabilities of a Markov input process that achieves a high information rate, whereas the LDPC codes are designed to maximize an iterative decoding threshold in the superchannel (concatenation of the ID channels and trellis codes).
  • G. Hosoya, T. Niinomi
    2020 International Symposium on Information Theory and its Applications 220-224 2020年10月  査読有り筆頭著者
  • Ryo Shibata, Gou Hosoya, Hiroyuki Yashima
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E103A(10) 1237-1247 2020年10月1日  
    Copyright © 2020 The Institute of Electronics, Information and Communication Engineers Over the past two decades, irregular low-density parity-check (LDPC) codes have not been able to decode information corrupted by insertion and deletion (ID) errors without markers. In this paper, we bring to light the existence of irregular LDPC codes that approach the symmetric information rates (SIR) of the channel with ID errors, even without markers. These codes have peculiar shapes in their check-node degree distributions. Specifically, the check-node degrees are scattered and there are degree-2 check nodes. We propose a code construction method based on the progressive edge-growth algorithm tailored for the scattered check-node degree distributions, which enables the SIR-approaching codes to progress in the finite-length regime. Moreover, the SIR-approaching codes demonstrate asymptotic and finite-length performance that outperform the existing counterparts, namely, concatenated coding of irregular LDPC codes with markers and spatially coupled LDPC codes.

MISC

 92

書籍等出版物

 1
  • 赤倉 貴子, 池口 徹, 谷口 行信, 浜田 知久馬, 古川 利博, 八嶋 弘幸, 池辺 淑子, 塩濱 敬之, 寒水 孝司, 立川 智章, 細谷 剛, 石井 隆稔, 奥野 貴之, 佐藤 寛之, 島田 裕, 高橋 智博, 藤原 寛太郎, 太原 育夫, 宮部 博史, 渡邉 均, 藤沢 匡哉 (担当:分担執筆)
    丸善出版 2018年4月30日 (ISBN: 9784621302859)

講演・口頭発表等

 131

所属学協会

 3

共同研究・競争的資金等の研究課題

 12

研究テーマ

 3
  • 研究テーマ
    情報通信
    研究期間(開始)
    2008/04/01
  • 研究テーマ
    情報学基礎論
    研究期間(開始)
    2008/04/01
  • 研究テーマ
    情報理論
    研究期間(開始)
    2008/04/01