Decoding of random network codes

DOI10.1134/S0032946010040034zbMath1233.94035OpenAlexW1989883908MaRDI QIDQ764085

Nina I. Pilipchuk, Martin Bossert, Ernst M. Gabidulin

Publication date: 13 March 2012

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946010040034

zbMATH Keywords

Gabidulin's rank-metric codesrandom rank errorsSilva-Kschischang-Kötter random network codessimultaneous correction of rank errors

Mathematics Subject Classification ID

Other types of codes (94B60) Decoding (94B35)

Related Items (8)

Construction of subspace codes through linkage ⋮ Rank subcodes in multicomponent network coding ⋮ New constructions of large cyclic subspace codes and Sidon spaces ⋮ Information security in a random network coding network ⋮ A characterization of cyclic subspace codes via subspace polynomials ⋮ Several kinds of large cyclic subspace codes via Sidon spaces ⋮ Bounds on the cardinality of subspace codes with non-maximum code distance ⋮ Cyclic orbit codes and stabilizer subfields

Cites Work

• Error and erasure correcting algorithms for rank codes
• Theory of codes with maximum rank distance
• Bilinear forms over a finite field, with applications to coding theory
• Maximum rank distance codes as space~time codes
• Coding for Errors and Erasures in Random Network Coding
• A Rank-Metric Approach to Error Control in Random Network Coding
• Coding and Cryptography
• Unnamed Item
• Unnamed Item

This page was built for publication: Decoding of random network codes