Recursive Code Construction for Random Networks

Vitaly Skachek

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment