Blind reconstruction of BCH codes based on candidate generator polynomial in random situation
Loading...
Access rights
openAccess
CC BY
CC BY
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
2024-12
Major/Subject
Mcode
Degree programme
Language
en
Pages
3
Series
Electronics Letters, Volume 60, issue 23
Abstract
A novel method for blind reconstruction of binary Bose–Chaudhuri–Hocquenghem codes is proposed. Compared to previously reported works, a new approach to find the goal generator polynomial is employed. First, using the feature that each codeword polynomial of a t-error-correcting Bose–Chaudhuri–Hocquenghem code has the same 2t consecutive roots over Galois field, a new set of candidate generator polynomials is introduced. Then, this set in a random situation to find the correct generator polynomial is investigated. Monte Carlo simulations demonstrate the superiority of the proposed reconstruction algorithm compared to the previous methods.Description
Publisher Copyright: © 2024 The Author(s). Electronics Letters published by John Wiley & Sons Ltd on behalf of The Institution of Engineering and Technology.
Keywords
signal processing, signal reconstruction, telecommunication channels
Other note
Citation
SharifianMazraeMolaei, A & Sharifian Mazraehmollaei, M 2024, ' Blind reconstruction of BCH codes based on candidate generator polynomial in random situation ', Electronics Letters, vol. 60, no. 23, e70109 . https://doi.org/10.1049/ell2.70109