PD-sets for Z₄-linear codes
Permutation decoding is a technique that strongly depends on the existence of a special subset, called PD-set, of the permutation automorphism group of a code. In this paper, a general criterion to obtain s-PD-sets of size s+1, which enable correction up to s errors, for Z₄-linear codes is provided....
| Autores: | , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2016 |
| País: | España |
| Recursos: | Universitat Autònoma de Barcelona |
| Repositorio: | Dipòsit Digital de Documents de la UAB |
| Idioma: | inglés |
| OAI Identifier: | oai:ddd.uab.cat:165802 |
| Acesso em linha: | https://ddd.uab.cat/record/165802 https://dx.doi.org/urn:doi:10.1109/ISIT.2016.7541512 |
| Access Level: | acceso abierto |
| Palavra-chave: | Error correction PD-set Z₄-linear code Hadamard code Kerdock code Permutation decoding Permutation automorphism group |
| Resumo: | Permutation decoding is a technique that strongly depends on the existence of a special subset, called PD-set, of the permutation automorphism group of a code. In this paper, a general criterion to obtain s-PD-sets of size s+1, which enable correction up to s errors, for Z₄-linear codes is provided. Furthermore, some explicit constructions of s-PD-sets of size s+1 for important families of (nonlinear) Z₄-linear codes such as Hadamard and Kerdock codes are given. |
|---|