• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Research on overlay network coding

Research Project

Project/Area Number 19560384
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Communication/Network engineering
Research InstitutionKobe University

Principal Investigator

KUWAKADO Hidenori  Kobe University, 大学院・工学研究科, 准教授 (30283914)

Project Period (FY) 2007 – 2009
Project Status Completed (Fiscal Year 2009)
Budget Amount *help
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2009: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2008: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2007: ¥2,860,000 (Direct Cost: ¥2,200,000、Indirect Cost: ¥660,000)
Keywords暗号・セキュリティ / ネットワーク符号化 / ビットスライス実装 / オーバーレイネットワーク / 受信者選択
Research Abstract

Network coding is a method to improve transmission efficiency with encoding of internal nodes. Recent works on network coding show that network coding is for achieving not only an efficient transmission but also useful functions. This research shows a network code for selecting receivers dynamically without changing encoding rules of internal nodes. In addition, we study the optimality of a bitslice implementation in the context of network computing. This is based on the similarity of the bitslice implementation and the network computing.

Report

(4 results)
  • 2009 Annual Research Report   Final Research Report ( PDF )
  • 2008 Annual Research Report
  • 2007 Annual Research Report
  • Research Products

    (10 results)

All 2010 2008 2007

All Journal Article (6 results) (of which Peer Reviewed: 1 results) Presentation (4 results)

  • [Journal Article] Improved Bitslice Network for Computing the TIB3 S-Box2010

    • Author(s)
      桑門秀典, 森井昌克
    • Journal Title

      電子情報通信学会2010総合大会講演論文集

      Pages: 130-130

    • Related Report
      2009 Final Research Report
  • [Journal Article] S-Box Bitslice Networks as Network Computing2010

    • Author(s)
      桑門秀典, 森井昌克
    • Journal Title

      電子情報通信学会技術研究報告 vol.109

      Pages: 35-38

    • NAID

      110008000407

    • Related Report
      2009 Final Research Report
  • [Journal Article] S-Box Bitslice Networks as Network Computing2010

    • Author(s)
      桑門秀典
    • Journal Title

      電子情報通信学会技術研究報告 IEICE-109

      Pages: 35-38

    • NAID

      110008000407

    • Related Report
      2009 Annual Research Report
  • [Journal Article] Improved Bitslice Network for Computing the TIB3 S-Box2010

    • Author(s)
      桑門秀典
    • Journal Title

      電子情報通信学会2010総合大会講演論文集

      Pages: 130-130

    • Related Report
      2009 Annual Research Report
  • [Journal Article] Multi-Bit Revocable Network Coding Scheme For Butterfly-Like Network2008

    • Author(s)
      桑門秀典, 森井昌克
    • Journal Title

      2008 International Symposium on Information Theory and its Applications

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Conditions for Achieving a Revocable Network Coding Scheme2008

    • Author(s)
      桑門秀典, 森井昌克
    • Journal Title

      電子情報通信学会技術研究報告 vol.107

      Pages: 55-58

    • NAID

      110006885172

    • Related Report
      2009 Final Research Report
  • [Presentation] Multi-Bit Revocable Network Coding Scheme For Butterfly-Like Network2008

    • Author(s)
      桑門秀典, 森井昌克
    • Organizer
      2008 International Symposium on Information Theory and its Applications
    • Place of Presentation
      New Zealand, Auckland
    • Year and Date
      2008-12-08
    • Related Report
      2008 Annual Research Report
  • [Presentation] Conditions for Achieving a Revocable Network Coding Scheme2008

    • Author(s)
      桑門秀典
    • Organizer
      電子情報通信学会情報理論研究会
    • Place of Presentation
      日本 東京都
    • Year and Date
      2008-02-28
    • Related Report
      2007 Annual Research Report
  • [Presentation] Indifferentiable Double-Block-Length Compression Function2007

    • Author(s)
      桑門秀典
    • Organizer
      2007 Hawaii and SITA Joint Conference on Information Theory
    • Place of Presentation
      アメリカ合衆国ハワイ州
    • Year and Date
      2007-05-31
    • Related Report
      2009 Final Research Report
  • [Presentation] Indifferentiable Double-Block-Length Compression Function2007

    • Author(s)
      桑門秀典
    • Organizer
      2007 Hawaii and SITA Joint Conference on Information Theory
    • Place of Presentation
      アメリカ合衆国 ハワイ州
    • Year and Date
      2007-05-31
    • Related Report
      2007 Annual Research Report

URL: 

Published: 2007-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi