Random matrices and codes for the erasure channel

DOI10.1007/s00453-008-9192-0zbMath1235.94081OpenAlexW2060429191MaRDI QIDQ848850

Ian F. Blake, Chris Studholme

Publication date: 23 February 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9192-0

zbMATH Keywords

random matricesbipartite graphserasure codesdecoding complexityrandom codes

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Other types of codes (94B60) Random matrices (algebraic aspects) (15B52) Decoding (94B35)

Related Items (5)

The Limitations of Optimization from Samples ⋮ A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory ⋮ On linear codes with random multiplier vectors and the maximum trace dimension property ⋮ Inclusion of forbidden minors in random representable matroids ⋮ Stein's method and the rank distribution of random matrices over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Raptor codes on binary memoryless symmetric channels
• The rank of sparse random matrices over finite fields

This page was built for publication: Random matrices and codes for the erasure channel