{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:22:32Z","timestamp":1753881752540,"version":"3.41.2"},"reference-count":12,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:p> Finding the values of [Formula: see text] and [Formula: see text] is a fundamental problem in classical coding theory. The [Formula: see text] is the size of the maximum independent set of [Formula: see text] which is the induced subgraph of vectors of weight [Formula: see text] of the [Formula: see text]-power of [Formula: see text]-dimensional hypercubes. Obviously, [Formula: see text]. In order to further understand and study the independent set of [Formula: see text], we explore its clique number and the structure of the maximum clique. In this paper, we obtain the clique number and the structure of the maximum clique of [Formula: see text] for [Formula: see text] As an application, by [Formula: see text] we obtain the upper bounds of [Formula: see text] for [Formula: see text] <\/jats:p>","DOI":"10.1142\/s0219265923500366","type":"journal-article","created":{"date-parts":[[2024,1,29]],"date-time":"2024-01-29T04:14:50Z","timestamp":1706501690000},"source":"Crossref","is-referenced-by-count":0,"title":["On the Maximum Cliques in Powers of Hypercubes"],"prefix":"10.1142","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4767-3953","authenticated-orcid":false,"given":"Yanting","family":"Hu","sequence":"first","affiliation":[{"name":"Department of Mathematics, Taiyuan University of Technology, Taiyuan, Shanxi 030024, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3827-7334","authenticated-orcid":false,"given":"Weihua","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Taiyuan University of Technology, Taiyuan, Shanxi 030024, China"}]}],"member":"219","published-online":{"date-parts":[[2024,1,27]]},"reference":[{"key":"S0219265923500366BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0163-9"},{"key":"S0219265923500366BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(66)80027-3"},{"key":"S0219265923500366BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/18.887851"},{"key":"S0219265923500366BIB004","series-title":"North-Holland Mathematical Library","volume-title":"The Theory of Error Correcting Codes","author":"Macwilliams F. J.","year":"1977"},{"key":"S0219265923500366BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2019.105156"},{"key":"S0219265923500366BIB006","first-page":"251","volume-title":"Proc. 21th ACM Symp. Theory Comput.","author":"Hstad J.","year":"1989"},{"key":"S0219265923500366BIB007","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxac103"},{"key":"S0219265923500366BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/18.45293"},{"key":"S0219265923500366BIB009","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"S0219265923500366BIB010","doi-asserted-by":"publisher","DOI":"10.1109\/71.242151"},{"key":"S0219265923500366BIB011","doi-asserted-by":"publisher","DOI":"10.12677\/AAM.2021.103081"},{"key":"S0219265923500366BIB012","doi-asserted-by":"publisher","DOI":"10.1109\/12.2234"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265923500366","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T02:13:12Z","timestamp":1738807992000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0219265923500366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,27]]},"references-count":12,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["10.1142\/S0219265923500366"],"URL":"https:\/\/doi.org\/10.1142\/s0219265923500366","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"type":"print","value":"0219-2659"},{"type":"electronic","value":"1793-6713"}],"subject":[],"published":{"date-parts":[[2024,1,27]]},"article-number":"2350036"}}