An alternative decoding method for Gabidulin codes in characteristic zero

@article{Melich2016AnAD,
  title={An alternative decoding method for Gabidulin codes in characteristic zero},
  author={Sven M{\"u}elich and Sven Puchinger and David M{\"o}dinger and Martin Bossert},
  journal={2016 IEEE International Symposium on Information Theory (ISIT)},
  year={2016},
  pages={2549-2553}
}
  • Sven Müelich, Sven Puchinger, +1 author Martin Bossert
  • Published 2016
  • Computer Science, Mathematics
  • 2016 IEEE International Symposium on Information Theory (ISIT)
  • Gabidulin codes, originally defined over finite fields, are an important class of rank metric codes with various applications. Recently, their definition was generalized to certain fields of characteristic zero and a Welch-Berlekamp like algorithm with complexity O(n3) was given. We propose a new application of Gabidulin codes over infinite fields: low-rank matrix recovery. Also, an alternative decoding approach is presented based on a Gao type key equation, reducing the complexity to at least… CONTINUE READING

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-7 OF 7 CITATIONS

    Low-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND

    Reed–Solomon Codes over Fields of Characteristic Zero

    VIEW 3 EXCERPTS
    CITES METHODS

    On decoding rank-metric codes over large fields

    • R. Roth
    • Computer Science
    • 2017 IEEE International Symposium on Information Theory (ISIT)
    • 2017
    VIEW 1 EXCERPT
    CITES BACKGROUND

    On decoding rank-metric codes over large fields

    • R. Roth
    • Computer Science, Mathematics
    • ISIT
    • 2017

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 37 REFERENCES

    Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius

    Rank metric and Gabidulin codes in characteristic zero

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes

    VIEW 1 EXCERPT

    Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes

    Bilinear Forms over a Finite Field, with Applications to Coding Theory

    VIEW 1 EXCERPT

    On the key equation