On the complexity of linear boolean operators with thin matrices

Under consideration is the problem of constructing a square Booleanmatrix A of order n without “rectangles” (it is a matrix whose every submatrix of the elements that are in any two rows and two columns does not consist of 1s). A linear transformation modulo two defined by A has complexity o(ν(A) − n) in the base {⊕}, where ν(A) is the weight of A, i.e., the number of 1s (the matrices without rectangles are called thin). Two constructions for solving this problem are given. In the first construction, n = p ² where p is an odd prime. The corresponding matrix H _p has weight p ³ and generates the linear transformation of complexity O(p ² log p log log p). In the second construction, the matrix has weight nk where k is the cardinality of a Sidon set in ℤ _n . We may assume that

$ k = Theta left( {sqrt n } right) $ k = Theta left( {sqrt n } right)
Keywords:
本文献已被 SpringerLink 等数据库收录！