2013•Acta ArithmeticaOpen access

Large families of pseudorandom binary sequences and lattices by using the multiplicative inverse

Huaning Liu

Open full text 9 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Large families of pseudorandom binary sequences and lattices by using the multiplicative inverse — Research Paper | ScholarLens