Maximum Size $t$-Intersecting Families and Anticodes | Sciact - Система учета научной деятельности ИМ СО РАН

Maximum Size $t$-Intersecting Families and Anticodes Научная публикация

Журнал

Electronic Journal of Combinatorics
ISSN: 1077-8926 , E-ISSN: 1097-1440

Вых. Данные

Год: 2026, Том: 33, Номер: 1, DOI: 10.37236/14074

Авторы

Wang Xuan ¹ , Etzion Tuvi ² , Krotov Denis S. ³ , Shi Minjia ¹

Организации

1	School of Mathematical Sciences, Anhui University
2	Computer Science Department Technion IIT, Haifa 32000 Israel
3	Sobolev Institute of Mathematics, Novosibirsk

Информация о финансировании (1)

Институт математики им. С.Л. Соболева СО РАН

FWNF-2022-0017

The maximum size of t-intersecting families is one of the most celebrated topics in combinatorics, and its size is known as the Erd}os-Ko-Rado theorem. Such intersecting families, also known as constant-weight anticodes in coding theory, were considered in a generalization of the well-known sphere-packing bound. In this work we consider the maximum size of t-intersecting families and their associated maxi mum size constant-weight anticodes over alphabet of size q > 2. It is proved that the structure of the maximum size constant-weight anticodes with the same length, weight, and diameter, depends on the alphabet size. This structure implies some hierarchy of constant-weight anticodes.

Wang X. , Etzion T. , Krotov D.S. , Shi M.
Maximum Size $t$-Intersecting Families and Anticodes
Electronic Journal of Combinatorics. 2026. V.33. N1. DOI: 10.37236/14074 WOS OpenAlex

Поступила в редакцию:	14 апр. 2025 г.
Принята к публикации:	2 нояб. 2025 г.
Опубликована online:	23 янв. 2026 г.

Web of science:	WOS:001673882000001
OpenAlex:	W7125429467

Пока нет цитирований