On linear complexity of binary lattices. II (Q457014): Difference between revisions

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)].