On the complexity of a family related to the Legendre symbol |
| |
| Authors: | Katalin Gyarmati |
| |
| Affiliation: | 1.Department of Algebra and Number Theory,E?tv?s Loránd University,Budapest,Hungary |
| |
| Abstract: | Ahlswede, Khachatrian, Mauduit and A. Sárközy introduced the notion of family-complexity of families of binary sequences. They estimated the family-complexity of a large family related to Legendre symbol introduced by Goubin, Mauduit and Sárközy. Here their result is improved, and apart from the constant factor the best lower bound is given for the family-complexity. |
| |
| Keywords: | KeywordHeading" > and phrases pseudorandom f-complexity |
| 本文献已被 SpringerLink 等数据库收录！ |
|
