Error-correcting codes on scale-free networks

TL;DR

This paper explores the use of scale-free networks with power-law degree distributions as error-correcting codes, showing they can achieve near-optimal performance on erasure channels.

Contribution

It demonstrates that codes based on scale-free networks with specific degree distributions can serve as effective error-correcting codes with performance close to Shannon limits.

Findings

Power-law degree distributions fit high-performance LDPC codes.

Codes with $p(k)=C(k+eta)^{- ho}$ perform well on erasure channels.

Potential to approach Shannon limit with scale-free network codes.

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 $p(k)\sim k^{-\gamma}$ with $\gamma$ 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 $p(k)=C(k+\alpha)^{-\gamma}$, with $k \geq 2$ and suitable selection of the parameters $\alpha$ and $\gamma$, indeed have very good error-correction capabilities.