{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:32:15Z","timestamp":1740133935346,"version":"3.37.3"},"reference-count":27,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771007"],"award-info":[{"award-number":["11771007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11601177"],"award-info":[{"award-number":["11601177"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572027"],"award-info":[{"award-number":["61572027"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2020,6]]},"abstract":"<jats:p> Frequency-hopping sequences (FHSs) with favorite partial Hamming correlation properties are intensively needed in many synchronization and multiple-access systems. Strictly optimal FHS sets are a kind of FHS sets which has optimal Hamming correlation for any correlation window. In this paper, firstly we present simplified representations of the generalized Lempel\u2013Greenberger bound on the partial Hamming autocorrelation of an FHS and the generalized Peng-Fan bound on the partial Hamming correlation of an FHS set, respectively. Secondly, we propose a direct construction of strictly optimal FHS sets, which interprets the previous construction proposed by Cai, Zhou, Yang and Tang. By choosing appropriate parameters and bijections, we present more flexible constructions of strictly optimal FHS sets. <\/jats:p>","DOI":"10.1142\/s0129054120500215","type":"journal-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T03:56:55Z","timestamp":1593403015000},"page":"499-513","source":"Crossref","is-referenced-by-count":0,"title":["Simplified Bounds on FHSs Set and Its Strictly Optimal Construction"],"prefix":"10.1142","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7242-1352","authenticated-orcid":false,"given":"Shanding","family":"Xu","sequence":"first","affiliation":[{"name":"Department of Mathematics and Physics, Nanjing Institute of Technology, Nanjing 211167, P. R. China"},{"name":"Key Laboratory of Mathematics and Interdisciplinary Sciences, Guangdong Higher Education Institutes, Guangzhou University, Guangzhou 510006, P. R. China"}]},{"given":"Xiwang","family":"Cao","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, P. R. China"},{"name":"State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, P. R. China"}]},{"given":"Jiafu","family":"Mi","sequence":"additional","affiliation":[{"name":"School of Science, Shandong University of Technology, Zibo 255091, P. R. China"}]},{"given":"Chunming","family":"Tang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Mathematics and Interdisciplinary Sciences, Guangdong Higher Education Institutes, Guangzhou University, Guangzhou 510006, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"key":"S0129054120500215BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055169"},{"key":"S0129054120500215BIB002","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834783"},{"key":"S0129054120500215BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833362"},{"key":"S0129054120500215BIB004","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2015.0864"},{"key":"S0129054120500215BIB005","doi-asserted-by":"publisher","DOI":"10.1109\/18.2616"},{"key":"S0129054120500215BIB006","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842708"},{"key":"S0129054120500215BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2006.03.019"},{"key":"S0129054120500215BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899545"},{"key":"S0129054120500215BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926410"},{"key":"S0129054120500215BIB010","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009856"},{"key":"S0129054120500215BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021366"},{"key":"S0129054120500215BIB012","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040888"},{"key":"S0129054120500215BIB013","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048504"},{"key":"S0129054120500215BIB014","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2137290"},{"key":"S0129054120500215BIB015","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162571"},{"key":"S0129054120500215BIB016","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2195771"},{"key":"S0129054120500215BIB017","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2237754"},{"key":"S0129054120500215BIB018","doi-asserted-by":"publisher","DOI":"10.1142\/S012905411650009X"},{"key":"S0129054120500215BIB019","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0220-9"},{"key":"S0129054120500215BIB020","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834792"},{"key":"S0129054120500215BIB021","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2167126"},{"key":"S0129054120500215BIB022","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332996"},{"key":"S0129054120500215BIB023","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2512859"},{"key":"S0129054120500215BIB024","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2551225"},{"key":"S0129054120500215BIB025","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2556710"},{"key":"S0129054120500215BIB026","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9910-0"},{"key":"S0129054120500215BIB027","doi-asserted-by":"publisher","DOI":"10.1142\/3254"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054120500215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T09:27:46Z","timestamp":1594286866000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054120500215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":27,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["10.1142\/S0129054120500215"],"URL":"https:\/\/doi.org\/10.1142\/s0129054120500215","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2020,6]]}}}