On binary linear codes and binary pseudo-random sequences
Carregando...
Arquivos
Fontes externas
Fontes externas
Data
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Tipo
Artigo
Direito de acesso
Arquivos
Fontes externas
Fontes externas
Resumo
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.
Descrição
Palavras-chave
generalized sequences, PN-sequences, Reed–Muller code, simplex code
Idioma
Inglês
Citação
Journal of Algebra and its Applications, v. 23, n. 7, 2024.
