Blind reconstruction of BCH codes based on candidate generator polynomial in random situation
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–Chaudh...
Saved in:
| Main Authors: | Ali Sharifian Mazraeh Mollaei, Masoud Sharifian Mazraeh Mollaei |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-12-01
|
| Series: | Electronics Letters |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/ell2.70109 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Secret key generation for reconfigurable intelligent surface‐assisted MISO multi‐user system
by: Kexin Liu, et al.
Published: (2024-12-01) -
Space alternating variational estimation based sparse Bayesian learning for complex‐value sparse signal recovery using adaptive Laplace priors
by: Zonglong Bai, et al.
Published: (2023-03-01) -
In‐field comparison between G.652 and G.655 optical fibres for polarisation‐based quantum key distribution
by: Costantino Agnesi, et al.
Published: (2024-12-01) -
Wireless quantum key distribution at terahertz frequencies: Opportunities and challenges
by: Neel Kanth Kundu, et al.
Published: (2024-12-01) -
Generalized Cardinal Polishing Splines Signal Reconstruction
by: Fangli Sun, et al.
Published: (2025-03-01)