On binary linear codes and binary pseudo-random sequences
In this paper, we study the relation between the linear subspace of the pseudo-noise (PN)-sequences generated by a primitive polynomial and the simplex code. This family of sequences can be also seen as an Maximum Distance Separable (MDS) F2-linear code over Fr2. Furthermore, we see how to compute t...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2024 |
| País: | Brasil |
| Institución: | Universidade Estadual Paulista (UNESP) |
| Repositorio: | Repositório Institucional da UNESP |
| Idioma: | inglés |
| OAI Identifier: | oai:repositorio.unesp.br:11449/296882 |
| Acceso en línea: | http://dx.doi.org/10.1142/S0219498825500677 https://hdl.handle.net/11449/296882 |
| Access Level: | acceso abierto |
| Palabra clave: | generalized sequences PN-sequences Reed–Muller code simplex code |
| Sumario: | In this paper, we study the relation between the linear subspace of the pseudo-noise (PN)-sequences generated by a primitive polynomial and the simplex code. This family of sequences can be also seen as an Maximum Distance Separable (MDS) F2-linear code over Fr2. Furthermore, we see how to compute the family of generalized sequences produced by a primitive polynomial by means of a first-order Reed–Muller code. |
|---|