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...
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
IEEE
2020-01-01
|
| Serie: | IEEE Access |
| Soggetti: | |
| Accesso online: | https://ieeexplore.ieee.org/document/9144565/ |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|