Recursive Code Construction for Random Networks
Information Theory
2016-11-17 v3 math.IT
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.
Cite
@article{arxiv.0806.3650,
title = {Recursive Code Construction for Random Networks},
author = {Vitaly Skachek},
journal= {arXiv preprint arXiv:0806.3650},
year = {2016}
}
Comments
Submitted to IEEE Transactions on Information Theory