Recursive Code Construction for Random Networks

DOI10.1109/TIT.2009.2039163MaRDI QIDQ4975987zbMATH OpenFDO

Authors Vitaly Skachek

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0806.3650

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Other types of codes (94B60)

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.

Cited in

(15)

• Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
• Message encoding and retrieval for spread and cyclic orbit codes
• Constructions of optimal Ferrers diagram rank metric codes
• New constructions of Sidon spaces
• Several classes of optimal Ferrers diagram rank-metric codes
• Improved upper bounds for partial spreads
• Construction of subspace codes through linkage
• Rank subcodes in multicomponent network coding
• On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
• List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
• Bilateral multilevel construction of constant dimension codes
• New lower bounds for partial k‐parallelisms
• Parallel construction for constant dimension codes from mixed dimension construction
• Decoding of random network codes
• Galois geometries and coding theory

This page was built for publication: Recursive Code Construction for Random Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975987)