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 <inline-formula> <tex-math notation="LaTeX">$F_{q}$ </tex-math></inline-formula> as polynomial codes have the advantages described above, but...
Guardat en:
| Autors principals: | , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
IEEE
2020-01-01
|
| Col·lecció: | IEEE Access |
| Matèries: | |
| Accés en línia: | https://ieeexplore.ieee.org/document/9144565/ |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|