Application of complex networks to coding

Authors:
Francis C. M. Lau;Chi K. Tse
Affiliations:
Hong Kong Polytechnic University, Hong Kong;Hong Kong Polytechnic University, Hong Kong
Venue:
IEEE Circuits and Systems Magazine - Special issue on complex networks applications in circuits and systems
Year:
2010

Citing 5
Cited 0

Analysis of low density codes and improved designs using irregular graphs

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Trellis and Turbo Coding

Trellis and Turbo Coding
Complex-network modeling of a call network

IEEE Transactions on Circuits and Systems Part I: Regular Papers
The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Regular and irregular progressive edge-growth tanner graphs

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Channel coding provides error-correction capability at the receiving end by adding redundant information (bits) to every block of data in the transmission. In this article, we describe how some results from complex networks can be applied to channel coding for communications. In particular, we explain how the average-path-length characteristic of complex networks can be used to help design low-density parity-check (LDPC) codes of very good error-correction capabilities, one of the most important problems in channel coding under hot pursuit.