Decoding of random network codes

DOI10.1134/S0032946010040034MaRDI QIDQ764085zbMATH OpenOpenAlexFDO

Authors E. M. Gabidulin, N. I. Pilipchuk, Martin Bossert

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 errors[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Silva-Kschischang-K%EF%BF%BD%EF%BF%BDtter+random+network+codes&go=Go Silva-Kschischang-K��tter random network codes]simultaneous correction of rank errors

Mathematics Subject Classification ID

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

Recommendations

• Aspects of Random Network Coding
• Exact decoding probability of random linear network coding for combinatorial networks
• The encoding complexity of network coding
• Random network coding over composite fields
• On Randomized Linear Network Codes and Their Error Correction Capabilities
• On network codes and partial spreads
• Recursive Code Construction for Random Networks
• Coding for Errors and Erasures in Random Network Coding

Cites work

• scientific article; zbMATH DE number 3991414 (Why is no real title available?)
• scientific article; zbMATH DE number 910964 (Why is no real title available?)
• A Rank-Metric Approach to Error Control in Random Network Coding
• Bilinear forms over a finite field, with applications to coding theory
• Coding and Cryptography
• Coding for Errors and Erasures in Random Network Coding
• Error and erasure correcting algorithms for rank codes
• Maximum rank distance codes as space~time codes
• Theory of codes with maximum rank distance

Cited in

(18)

• Random matrices and codes for the erasure channel
• Exact decoding probability of random linear network coding for combinatorial networks
• A characterization of cyclic subspace codes via subspace polynomials
• Aspects of Random Network Coding
• New constructions of large cyclic subspace codes via Sidon spaces
• Construction of subspace codes through linkage
• Rank subcodes in multicomponent network coding
• An algebraic approach for decoding spread codes
• New constructions of large cyclic subspace codes and Sidon spaces
• On decoding of DVR-based linear network codes
• Two new constructions of cyclic subspace codes via Sidon spaces
• Several kinds of large cyclic subspace codes via Sidon spaces
• Bounds on the cardinality of subspace codes with non-maximum code distance
• Information security in a random network coding network
• A Rank-Metric Approach to Error Control in Random Network Coding
• Coding for Errors and Erasures in Random Network Coding
• Cyclic orbit codes and stabilizer subfields
• Rainbow Network Flow of Multiple Description Codes

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

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