Recursive Code Construction for Random Networks

DOI10.1109/TIT.2009.2039163zbMath1366.94750arXiv0806.3650MaRDI QIDQ4975987

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)

Related Items (13)

Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases ⋮ New constructions of Sidon spaces ⋮ Construction of subspace codes through linkage ⋮ Rank subcodes in multicomponent network coding ⋮ Improved upper bounds for partial spreads ⋮ 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 ⋮ Message encoding and retrieval for spread and cyclic orbit codes ⋮ New lower bounds for partial k‐parallelisms ⋮ Galois geometries and coding theory ⋮ Constructions of optimal Ferrers diagram rank metric codes ⋮ Several classes of optimal Ferrers diagram rank-metric codes

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