Keyword : random graphs

Probabilistic Analysis on Minimum s-t Cut Capacity of Random Graphs with Specified Degree Distribution
Yuki FUJII Tadashi WADAYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2014/12/01
Vol. E97-A  No. 12 ; pp. 2317-2324
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
minimum cut, random graphs, LDGM code, 
 Summary | Full Text:PDF(572.9KB)
The Achievable Rate-Distortion Region for Distributed Source Coding with One Distortion Criterion and Correlated Messages
Suhan CHOI Hichan MOON 
Publication:   IEICE TRANSACTIONS on Communications
Publication Date: 2012/09/01
Vol. E95-B  No. 9 ; pp. 2914-2917
Type of Manuscript:  LETTER
Category: Fundamental Theories for Communications
Keyword: 
distributed source coding, achievable rate-distortion region, correlated messages, Berger-Yeung problem, random graphs, 
 Summary | Full Text:PDF(123.9KB)
Transmission of Correlated Messages over Interference Channels with Strong Interference
Suhan CHOI Eunchul YOON Hichan MOON 
Publication:   IEICE TRANSACTIONS on Communications
Publication Date: 2008/12/01
Vol. E91-B  No. 12 ; pp. 3998-4002
Type of Manuscript:  LETTER
Category: Fundamental Theories for Communications
Keyword: 
interference channels, correlated messages, achievable rate region, random graphs, 
 Summary | Full Text:PDF(320.9KB)