{"id":"https://openalex.org/W1973546001","doi":"https://doi.org/10.1109/isit.2005.1523504","title":"Construction of constant weight code and some upper bounds","display_name":"Construction of constant weight code and some upper bounds","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1973546001","doi":"https://doi.org/10.1109/isit.2005.1523504","mag":"1973546001"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523504","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523504","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088104427","display_name":"Fanxin Zeng","orcid":"https://orcid.org/0000-0002-7320-400X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fanxin Zeng","raw_affiliation_strings":["Chongqing Communication Institute, Chongqing, China","Graduate School, Chongqing Communication Institute,"],"affiliations":[{"raw_affiliation_string":"Chongqing Communication Institute, Chongqing, China","institution_ids":[]},{"raw_affiliation_string":"Graduate School, Chongqing Communication Institute,","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5088104427"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.09197417,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"1073","last_page":"1077"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10575","display_name":"Wireless Communication Networks Research","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.754986584186554},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6970421075820923},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6928741931915283},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.65047287940979},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.5613467693328857},{"id":"https://openalex.org/keywords/equidistant","display_name":"Equidistant","score":0.5552002191543579},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.5441679358482361},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5118650794029236},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5068369507789612},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5015513896942139},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4167398512363434},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.28783172369003296},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21899381279945374},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.20190313458442688},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.14749819040298462},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.12787243723869324},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07992735505104065},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05795770883560181}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.754986584186554},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6970421075820923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6928741931915283},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.65047287940979},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.5613467693328857},{"id":"https://openalex.org/C158245278","wikidata":"https://www.wikidata.org/wiki/Q4386982","display_name":"Equidistant","level":2,"score":0.5552002191543579},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.5441679358482361},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5118650794029236},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5068369507789612},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5015513896942139},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4167398512363434},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.28783172369003296},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21899381279945374},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.20190313458442688},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.14749819040298462},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.12787243723869324},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07992735505104065},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05795770883560181},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2005.1523504","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523504","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1480210121","https://openalex.org/W1606480398","https://openalex.org/W2041588219","https://openalex.org/W2058219874","https://openalex.org/W2113142402","https://openalex.org/W2809548040","https://openalex.org/W2895335898"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2105471374","https://openalex.org/W2963549154","https://openalex.org/W2158117886","https://openalex.org/W1987803429","https://openalex.org/W1582340598","https://openalex.org/W1519122282","https://openalex.org/W1530654122","https://openalex.org/W2182731056","https://openalex.org/W3013281356"],"abstract_inverted_index":{"Properties":[0],"of":[1,11,46,53,76],"m-sequence":[2],"are":[3],"derived,":[4],"based":[5],"on":[6,65],"the":[7,42,72],"properties,":[8],"a":[9],"family":[10],"binary":[12,20],"nonlinear":[13,21],"constant":[14,22,84,88],"weight":[15,23,89],"codes":[16,24],"is":[17],"presented,":[18],"these":[19],"can":[25],"be":[26],"employed":[27],"in":[28,48,78],"automatic":[29],"repeat":[30],"request":[31],"(ARQ)":[32],"communication":[33],"system.":[34],"In":[35],"addition,":[36],"let":[37,67],"Q/sub":[38,121,143],"q/":[39,69,115,122,137,144],"(n,d)":[40,123,145],"denote":[41,71],"maximal":[43],"possible":[44,74],"number":[45,75,108],"codewords":[47,61,77],"any":[49,79],"q-ary":[50,80],"equidistant":[51,81],"code":[52,82],"length":[54,86],"n":[55],"and":[56,131],"Hamming":[57,91],"distance":[58,92],"d":[59,93],"between":[60,94],"(with":[62],"no":[63],"restriction":[64],"weight),":[66],"E/sub":[68,114,136],"(n,d,w)":[70,116,138],"largest":[73],"with":[83],"weight,":[85],"n,":[87,98,141],"w,":[90],"codewords.":[95],"Let":[96],"q,":[97],"d,":[99],"w":[100],"/spl":[101,117,124,139,146],"isin/":[102],"N,":[103],"here":[104],"N":[105],"denotes":[106],"natural":[107],"set.":[109],"We":[110],"show":[111],"that":[112],"1)":[113],"les/":[118,125,140,147],"qn,":[119],"2)":[120],"qn+1,":[126],"when":[127],"q":[128],">":[129],"2,":[130],"if":[132],"q=2,":[133],"then":[134],"3)":[135],"4)":[142],"n+1.":[148]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}