Fast, efficient Fermat number transform used to compute F'(x) analogous to computation of syndrome in conventional decoding scheme. Eliminates polynomial multiplications and reduces number of multiplications in reconstruction of F'(x) to n log (n). Euclidean algorithm used to evaluate F(x) directly, without going through intermediate steps of solving error-locator and error-evaluator polynomials. Algorithm suitable for implementation in very-large-scale integrated circuits.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Fast Transform Decoding Of Nonsystematic Reed-Solomon Codes


    Contributors:

    Published in:

    Publication date :

    1992-04-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English






    Fast Reed-Solomon Decoder

    Liu, K. Y. | NTRS | 1986



    Mapping Between Distinct Reed-Solomon Codes

    Perlman, Marvin | NTRS | 1994