Large families of pseudorandom binary sequences and lattices by using the multiplicative inverse
Huaning Liu
Abstract
Open-access reader
Huaning Liu
Abstract
Open-access reader
Large families of pseudorandom binary sequences and lattices are constructed by using the multiplicative inverse and estimates of exponential sums in a finite field. Pseudorandom measures of binary sequences and lattices are studied.
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Large families of pseudorandom binary sequences and lattices are constructed by using the multiplicative inverse and estimates of exponential sums in a finite field. Pseudorandom measures of binary sequences and lattices are studied.
Key concepts: Pseudorandom number generator, Pseudorandom generator theorem, Mathematics, Pseudorandom binary sequence, Multiplicative inverse, Multiplicative function, Binary number, Inverse