This paper describes a class of rate 1 /2 nonsystematic convolutional codes. Theoretical analyses are given to show 1) that with these codes the information sequence is extracted as reliably as possible without decoding for nonsystematic codes and 2) that the constraints imposed to achieve the quicklook-in feature do not significantly limit the error-correcting ability of the codes in the sense that the gilbert bound on minimum distance can still be attained under these constraints. These codes have been adopted for use in several forthcoming space missions.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Nonsystematic convolutional codes for sequential decoding in space applications


    Contributors:

    Published in:

    IEEE TR. COMMUN. TECHNOLOGY ; COM-19 , 5 ; 806-813


    Publication date :

    1971


    Size :

    8 Seiten, 2 Bilder, 2 Tabellen, 15 Quellen



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    Fast Transform Decoding Of Nonsystematic Reed-Solomon Codes

    Truong, Trieu-Kie / Cheung, Kar-Ming / Shiozaki, A. et al. | NTRS | 1992



    A Comparison of Modified Convolutional Codes with Sequential Decoding and Turbo Codes

    Morakis, J. / Miller, W. / IEEE; Aerospace and Electronics Systems Society | British Library Conference Proceedings | 1998


    Simplified Decoding of Convolutional Codes

    Truong, T. K. / Reed, I. S. | NTRS | 1986