Zusammenfassung

Many metrics used in coding theory are instances of a combinatorial metric introduced by Gabidulin. We define a weighted combinatorial semimetric. Some relations between these two metrics are established. Given an error and erasure decoder for the combinatorial metric, we propose the Forney-Kovalev soft-input-decoder for the weighted combinatorial metric. The error correcting radius of the algorithm is obtained for given number of decoding trials.

Links und Ressourcen

Tags

Community

  • @unibiblio
  • @inue
  • @christiansenger
@unibiblios Tags hervorgehoben