Concepts inAlgorithm 823: Implementing scrambled digital sequences
Sequence
In mathematics, a sequence is an ordered list of objects (or events). Like a set, it contains members (also called elements), and the number of ordered element (possibly infinite) is called the length of the sequence. Unlike a set, order matters, and exactly the same elements can appear multiple times at different positions in the sequence. A sequence is a discrete function. For example, (C, R, Y) is a sequence of letters that differs from (Y, C, R), as the ordering matters.
more from Wikipedia
Sobol sequence
Sobol sequences (also called LP¿ sequences or sequences in base 2) are an example of quasi-random low-discrepancy sequences. They were first introduced by the Russian mathematician I. M. Sobol (¿¿¿¿ ¿¿¿¿¿¿¿¿ ¿¿¿¿¿¿) in 1967. These sequences use a base of two to form successively finer uniform partitions of the unit interval, and then reorder the coordinates in each dimension.
more from Wikipedia
Computer program
A computer program (also software, or just a program) is a sequence of instructions written to perform a specified task with a computer. A computer requires programs to function, typically executing the program's instructions in a central processor. The program has an executable form that the computer can use directly to execute the instructions.
more from Wikipedia
Root mean square
In mathematics, the root mean square (abbreviated RMS or rms), also known as the quadratic mean, is a statistical measure of the magnitude of a varying quantity. It is especially useful when variates are positive and negative, e.g. , sinusoids. RMS is used in various fields, including electrical engineering. It can be calculated for a series of discrete values or for a continuously varying function.
more from Wikipedia
Niederreiter cryptosystem
In cryptography, the Niederreiter cryptosystem is a variation of the McEliece Cryptosystem developed in 1986 by Harald Niederreiter . It applies the same idea to the parity check matrix H of a linear code. Niederreiter is equivalent to McEliece from a security point of view. It uses a syndrome as ciphertext and the message is an error pattern. The encryption of Niederreiter is about ten times faster than the encryption of McEliece.
more from Wikipedia