On linear complexity of binary lattices. II (Q457014): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11139-013-9500-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016009009 / rank | |||
Normal rank | |||
Revision as of 20:39, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On linear complexity of binary lattices. II |
scientific article |
Statements
On linear complexity of binary lattices. II (English)
0 references
26 September 2014
0 references
For \(M,N\in \mathbb{N}\) let \(I_{M,N}\) denote the lattice point rectangle \[ I_{M,N}=\left\{(x,y): x\in \{0,1,\cdots,M-1\}, y\in\{0,1,\cdots,N-1\}\right\}. \] A function of type \(\delta(\mathbf{x}): I_{M,N}\rightarrow\{1,0\}\) is called a bit \((M,N)\)-lattice. This paper studies the linear complexity and \(k\)-error linear complexity of a truly random bit \((M,N)\)-lattice. For Part I, see [Ramanujan J. 32, No. 2, 185--201 (2013; Zbl 1312.11063)].
0 references
linear complexity
0 references
linear recursion
0 references
two dimensions
0 references
binary lattice
0 references
pseudorandomness
0 references
