Large Families of Pseudorandom Sequences of k Symbols and Their Complexity

Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I

Published:2006 Issue: Volume: Page:293-307
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Ahlswede R.,Mauduit C.,Sárközy A.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11889342_16.pdf

Reference18 articles.

1. Ahlswede, R.: Coloring hypergraphs: A new approach to multi???user source coding, Part I. J. Combinatorics, Information and System Sciences??4(1), 76???115 (1979);

2. Part II, J. Combinatorics, Information and System Sciences 5(3), 220???268 (1980)

3. Lecture Notes in Computer Science;R. Ahlswede,2006

4. Ahlswede, R., Winter, A.: Strong converse for identification via quantum channels. IEEE Trans. on Inform. 48(3), 569–579 (2002)

5. Ahlswede, R., Khachatrian, L.H., Mauduit, C., Sárközy, A.: A complexity measure for families of binary sequences. Periodica Math. Hungar. 46(2), 107–118 (2003)

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the correlation of $ k $ symbols;AIMS Mathematics;2024

2. On the pseudorandom properties of $ k $-ary Sidel'nikov sequences;Advances in Mathematics of Communications;2021

3. A new lower bound on the family complexity of Legendre sequences;Applicable Algebra in Engineering, Communication and Computing;2020-06-22

4. On the Cross-Combined Measure of Families of Binary Lattices and Sequences;Number-Theoretic Methods in Cryptology;2018

5. SYSTEMS OF CONGRUENCES WITH PRODUCTS OF VARIABLES FROM SHORT INTERVALS;Bulletin of the Australian Mathematical Society;2015-11-11