Recursive Code Construction for Random Networks

TL;DR

This paper introduces a modified coding scheme for random networks that improves information rate while preserving error correction, along with an efficient decoding algorithm.

Contribution

It presents a new recursive code construction for random networks with higher information rate and an efficient decoding method, building on Koetter-Kschischang codes.

Findings

Higher information rate achieved

Maintains same error-correcting capabilities

Efficient decoding algorithm developed

Abstract

A modification of Koetter-Kschischang codes for random networks is presented (these codes were also studied by Wang et al. in the context of authentication problems). The new codes have higher information rate, while maintaining the same error-correcting capabilities. An efficient error-correcting algorithm is proposed for these codes.