z-logo
open-access-imgOpen Access
Parity‐check multiplicity in binary cyclic codes
Author(s) -
Arul V.,
Frost G.,
Jung D.
Publication year - 2013
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2013.2677
Subject(s) - binary number , multiplicity (mathematics) , parity (physics) , mathematics , algorithm , computer science , arithmetic , discrete mathematics , physics , particle physics , mathematical analysis
Tests to determine the multiplicity of (1 + x ) in a polynomial in 2 [ x ] are provided. The primary application is to detect decode failure in binary BCH codes whose generator polynomial includes multiple factors of (1 + x ).

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here