Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/8941
Title: Application of complex-network theories to the design of short-length low-density-parity-check codes
Authors: Zheng, X
Lau, FCM 
Tse, CK 
He, Y
Hau, S 
Issue Date: 2009
Source: IET Communications, 2009, v. 3, no. 10, ICEOCW000003000010001569000001, p. 1569-1577 How to cite?
Journal: IET Communications 
Abstract: Study of complex networks has been conducted across many fields of science, including computer networks, biological networks and social networks. Characteristics of different types of complex networks such as random networks, regular-coupled networks, small-world networks and scale-free networks have been discovered by researchers. Application of such network properties to solve engineering problems, however, is still at the infancy stage. In this study, we make one of the first attempts in applying complex network theories to communications engineering. In particular, inspired by the shortest-average-path-length property of scale-free networks, we design short-length low-density-parity-check (LDPC) codes with an aim to shortening the average distance between any two variable nodes. We will also compare the error performance, both theoretically and by simulations, of the proposed codes with those of other well-known LDPC codes.
URI: http://hdl.handle.net/10397/8941
ISSN: 1751-8628
DOI: 10.1049/iet-com.2008.0503
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

10
Last Week
0
Last month
0
Citations as of Aug 17, 2017

WEB OF SCIENCETM
Citations

9
Last Week
0
Last month
Citations as of Aug 21, 2017

Page view(s)

44
Last Week
5
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.