Author:
Matolcsi Máté,Ruzsa Imre Z.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Mathematics,Analysis
Reference18 articles.
1. Alon, N., Orlitsky, A.: Repeated communications and Ramsey graphs. IEEE Trans. Inf. Theory 41, 1276–1289 (1995)
2. Barg, A., Jaffe, D.B.: Numerical results on the asymptotic rate of binary codes. In: Barg, A., Litsyn, S. (eds.) Codes and Association Schemes. Amer. Math. Soc., Providence (2001)
3. Bourgain, J.: Ruzsa’s problem on sets of recurrence. Isr. J. Math. 59, 150–166 (1987)
4. Delsarte, Ph.: An algebraic approach to the association scheme of coding theory. Philips Res. Rep., Suppl. 10 (1973)
5. Green, B.: Counting sets with small sumset, and the clique number of random Cayley graphs. Combinatorica 25(3), 307–326 (2005)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A note on approximate Hadamard matrices;Designs, Codes and Cryptography;2024-06-04
2. On Sárközy’s theorem for shifted primes;Journal of the American Mathematical Society;2023-09-28
3. Approximately Hadamard Matrices and Riesz Bases in Random Frames;International Mathematics Research Notices;2023-04-25
4. Paley graphs and sárközy’s theorem in function fields;The Quarterly Journal of Mathematics;2022-11-30
5. Dual bounds for the positive definite functions approach to mutually unbiased bases;Sampling Theory, Signal Processing, and Data Analysis;2022-09-22