Constructions of Polynomial Codes Based on Circular Permutation Over Finite Fields
As a kind of very important error-correcting codes, polynomial codes have the advantages of good performance and simple structure. Generalized R-S codes over F<sub>q</sub> as polynomial codes have the advantages described above, but their lengths n are at most q. In order to increase the...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9144565/ |