Smaller Bound of Superconcentrator

スポンサーリンク

概要

• 論文の詳細を見る

• A Superconcentrator is a directed acyclic graph with specific properties. The existence of linear-sized supercentrator has been proved in [4]. Since then, the size has been decreased significantly. The best known size is 28N which is proved by U. Schöning in [8]. Our work follows their construction and proves a smaller size superconcentrator.

著者

• KAN Haibin

  Shanghai Key Lab of Intelligent Information Processing, School of Computer Sciences, Fudan University

• YUAN Chen

  Shanghai Key Lab of Intelligent Information Processing, School of Computer Science, Fudan University

• KAN Haibin

  Shanghai Key Lab of Intelligent Information Processing, School of Computer Science, Fudan University

関連論文

• Space-Time Block Codes from Quasi-Orthogonal Designs with Maximal Rate or Minimal Decoding Complexity
• An Efficient Interpolation Based Erasure-Only Decoder for High-Rate Reed-Solomon Codes
• Smaller Bound of Superconcentrator
• The Degree of Two Classes of 3rd Order Correlation Immune Symmetric Boolean Functions
• An Efficient Hybrid Cryptographic Scheme for Wireless Sensor Network with Network Coding
• Smaller Bound of Superconcentrator

スポンサーリンク