Error-correcting codes on scale-free networks
arXiv:cond-mat/0401170 · doi:10.1103/PhysRevE.69.067103
Abstract
We investigate the potential of scale-free networks as error-correcting codes. We find that irregular low-density parity-check codes with highest performance known to date have degree distributions well fitted by a power-law function with close to 2, which suggests that codes built on scale-free networks with appropriate power exponents can be good error-correcting codes, with performance possibly approaching the Shannon limit. We demonstrate for an erasure channel that codes with power-law degree distribution of the form , with and suitable selection of the parameters and , indeed have very good error-correction capabilities.
arXiv comment4 pages, 3 figures
References in corpus (15)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The diameter of the world wide web
- The large-scale organization of metabolic networks
- Random graphs with arbitrary degree distributions and their applications
- Evolution of networks
- Who is the best connected scientist? A study of scientific coauthorship networks
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Connectivity of Growing Random Networks
- Scale-Free Networks are Ultrasmall
- The Fractal Properties of Internet
- Typical Performance of Gallager-type Error-Correcting Codes
- The Dynamic Phase Transition for Decoding Algorithms
- Error-Correcting Codes That Nearly Saturate Shannon's Bound
- Statistical Mechanics and Capacity-Approaching Error-Correcting Codes