Open AccessProof of Golomb’s conjecture in Fq with Γ$-pseudorandom sequences
Author(s) -
Yonghong Liu
Publication year - 2020
Publication title -
european journal of pure and applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.245
H-Index - 5
ISSN - 1307-5543
DOI - 10.29020/nybg.ejpam.v1i1.3594
Subject(s) - golomb coding , mathematics , pseudorandom number generator , conjecture , combinatorics , discrete mathematics , algorithm , computer science , artificial intelligence , image compression , image (mathematics) , image processing
This article offers a short proof of Golomb's conjecture, and then our results show that the sequences are pseudorandom in $\mathbb{F}_2$.