{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T08:01:44Z","timestamp":1769155304927,"version":"3.49.0"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The maximum size of $t$-intersecting families is one of the most celebrated topics in combinatorics, and its size is known as the Erd\u0151s-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 maximum size constant-weight anticodes over alphabet of size $q &gt;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.<\/jats:p>","DOI":"10.37236\/14074","type":"journal-article","created":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T16:52:41Z","timestamp":1769100761000},"source":"Crossref","is-referenced-by-count":0,"title":["Maximum Size $t$-Intersecting Families and Anticodes"],"prefix":"10.37236","volume":"33","author":[{"given":"Xuan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Tuvi","family":"Etzion","sequence":"additional","affiliation":[]},{"given":"Denis S.","family":"Krotov","sequence":"additional","affiliation":[]},{"given":"Minjia","family":"Shi","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2026,1,23]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i1p15\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i1p15\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T16:52:41Z","timestamp":1769100761000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v33i1p15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,23]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1,9]]}},"URL":"https:\/\/doi.org\/10.37236\/14074","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,23]]},"article-number":"P1.15"}}