A fast method for blindly identifying Reed‐Solomon codes based on matrix analysis
Abstract For the identification of Reed‐Solomon (RS) codes, the existing methods need to test the possible codeword length and the primitive polynomials exhaustively. Exhaustive search leads to high computational complexity. To overcome this limitation and fulfill the requirement in practice, a fast...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-12-01
|
| Series: | IET Communications |
| Online Access: | https://doi.org/10.1049/cmu2.12493 |