Comparing decoding methods for quaternary linear codes
Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permutation automorphism group of a code C. Constructions of small PD-sets for partial decoding for two families of Z₄-linear codes (Hadamard and Kerdock) are given. Moreover, different decoding methods for...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2016 |
| País: | España |
| Institución: | Universitat Autònoma de Barcelona |
| Repositorio: | Dipòsit Digital de Documents de la UAB |
| Idioma: | inglés |
| OAI Identifier: | oai:ddd.uab.cat:165799 |
| Acceso en línea: | https://ddd.uab.cat/record/165799 https://dx.doi.org/urn:doi:10.1016/j.endm.2016.09.049 |
| Access Level: | acceso abierto |
| Palabra clave: | Z₄-linear codes PD-sets Decoding Hadamard codes Kerdock codes |
| Sumario: | Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permutation automorphism group of a code C. Constructions of small PD-sets for partial decoding for two families of Z₄-linear codes (Hadamard and Kerdock) are given. Moreover, different decoding methods for Z₄-linear codes are compared by showing their performance applied to these two families. |
|---|