Login / Signup

On the Concatenation of Non-Binary Random Linear Fountain Codes with Maximum Distance Separable Codes.

Francisco Lázaro BlascoGianluigi Liva
Published in: ICC (2011)
Keyphrases
  • non binary
  • maximum distance
  • decoding algorithm
  • constraint satisfaction problems
  • feature space
  • special case
  • data mining
  • graphical models
  • np complete
  • constraint satisfaction