Samorodnitsky, Alex One more proof of the first linear programming bound for binary codes and two conjectures. (English) Zbl 07748854 Isr. J. Math. 256, No. 2, 639-673 (2023). MSC: 94B05 90C05 PDFBibTeX XMLCite \textit{A. Samorodnitsky}, Isr. J. Math. 256, No. 2, 639--673 (2023; Zbl 07748854) Full Text: DOI arXiv
Polyanskiy, Yury; Samorodnitsky, Alex Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube. (English) Zbl 1423.60038 J. Funct. Anal. 277, No. 11, Article ID 108280, 33 p. (2019). MSC: 60E15 46E35 94D05 PDFBibTeX XMLCite \textit{Y. Polyanskiy} and \textit{A. Samorodnitsky}, J. Funct. Anal. 277, No. 11, Article ID 108280, 33 p. (2019; Zbl 1423.60038) Full Text: DOI arXiv
Navon, Michael; Samorodnitsky, Alex Linear programming bounds for codes via a covering argument. (English) Zbl 1173.90475 Discrete Comput. Geom. 41, No. 2, 199-207 (2009). MSC: 94B65 90C05 65T50 PDFBibTeX XMLCite \textit{M. Navon} and \textit{A. Samorodnitsky}, Discrete Comput. Geom. 41, No. 2, 199--207 (2009; Zbl 1173.90475) Full Text: DOI arXiv
Samorodnitsky, Alex On the optimum of Delsarte’s linear program. (English) Zbl 0991.94060 J. Comb. Theory, Ser. A 96, No. 2, 261-287 (2001). Reviewer: Patric Östergård (Helsinki) MSC: 94B65 90C05 51E22 PDFBibTeX XMLCite \textit{A. Samorodnitsky}, J. Comb. Theory, Ser. A 96, No. 2, 261--287 (2001; Zbl 0991.94060) Full Text: DOI