Decoding of random network codes
DOI10.1134/S0032946010040034zbMATH Open1233.94035OpenAlexW1989883908MaRDI QIDQ764085FDOQ764085
N. I. Pilipchuk, Martin Bossert, E. 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
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
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
Cites Work
- Bilinear forms over a finite field, with applications to coding theory
- Theory of codes with maximum rank distance
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Maximum rank distance codes as space~time codes
- Coding and Cryptography
- Error and erasure correcting algorithms for rank codes
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- 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
- New constructions of large cyclic subspace codes and Sidon spaces
- 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
- 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)
