{"id":"https://openalex.org/W2009454976","doi":"https://doi.org/10.1142/s1793830911001127","title":"QUASI-CYCLIC CODES FROM CYCLIC-STRUCTURED DESIGNS WITH GOOD PROPERTIES","display_name":"QUASI-CYCLIC CODES FROM CYCLIC-STRUCTURED DESIGNS WITH GOOD PROPERTIES","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2009454976","doi":"https://doi.org/10.1142/s1793830911001127","mag":"2009454976"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830911001127","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830911001127","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-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/A5001849682","display_name":"Christos Koukouvinos","orcid":"https://orcid.org/0000-0003-1907-2031"},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"CHRISTOS KOUKOUVINOS","raw_affiliation_strings":["Department of Mathematics, National Technical University of Athens, Zografou 15773, Athens, Greece","Department of Mathematics , National Technical University of Athens , Zografou, 15773, Athens, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, National Technical University of Athens, Zografou 15773, Athens, Greece","institution_ids":["https://openalex.org/I174458059"]},{"raw_affiliation_string":"Department of Mathematics , National Technical University of Athens , Zografou, 15773, Athens, Greece","institution_ids":["https://openalex.org/I174458059"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059115625","display_name":"Dimitris E. Simos","orcid":"https://orcid.org/0000-0002-6399-6103"},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"DIMITRIS E. SIMOS","raw_affiliation_strings":["Department of Mathematics, National Technical University of Athens, Zografou 15773, Athens, Greece","Department of Mathematics , National Technical University of Athens , Zografou, 15773, Athens, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, National Technical University of Athens, Zografou 15773, Athens, Greece","institution_ids":["https://openalex.org/I174458059"]},{"raw_affiliation_string":"Department of Mathematics , National Technical University of Athens , Zografou, 15773, Athens, Greece","institution_ids":["https://openalex.org/I174458059"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001849682"],"corresponding_institution_ids":["https://openalex.org/I174458059"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07679782,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"03","issue":"02","first_page":"223","last_page":"243"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9954000115394592,"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"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9954000115394592,"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/T11130","display_name":"Coding theory and cryptography","score":0.993399977684021,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9898999929428101,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/circulant-matrix","display_name":"Circulant matrix","score":0.7730572819709778},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5257038474082947},{"id":"https://openalex.org/keywords/expander-code","display_name":"Expander code","score":0.49656134843826294},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.48004138469696045},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.47217100858688354},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.45187872648239136},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.4212521016597748},{"id":"https://openalex.org/keywords/combinatorial-method","display_name":"Combinatorial method","score":0.4157350957393646},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4105778634548187},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3818874955177307},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3506661057472229},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33777159452438354},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1744929552078247},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.11383882164955139}],"concepts":[{"id":"https://openalex.org/C115973184","wikidata":"https://www.wikidata.org/wiki/Q245457","display_name":"Circulant matrix","level":2,"score":0.7730572819709778},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5257038474082947},{"id":"https://openalex.org/C108509264","wikidata":"https://www.wikidata.org/wiki/Q5420758","display_name":"Expander code","level":5,"score":0.49656134843826294},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.48004138469696045},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.47217100858688354},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.45187872648239136},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.4212521016597748},{"id":"https://openalex.org/C2779521423","wikidata":"https://www.wikidata.org/wiki/Q3855646","display_name":"Combinatorial method","level":2,"score":0.4157350957393646},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4105778634548187},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3818874955177307},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3506661057472229},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33777159452438354},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1744929552078247},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.11383882164955139}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830911001127","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830911001127","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1516318957","https://openalex.org/W1606480398","https://openalex.org/W1966896243","https://openalex.org/W1969223581","https://openalex.org/W1971669936","https://openalex.org/W1975787946","https://openalex.org/W1978678271","https://openalex.org/W1980741888","https://openalex.org/W1991663098","https://openalex.org/W2006901874","https://openalex.org/W2022602747","https://openalex.org/W2026316191","https://openalex.org/W2039551368","https://openalex.org/W2040517404","https://openalex.org/W2060302767","https://openalex.org/W2062909403","https://openalex.org/W2065026674","https://openalex.org/W2065370326","https://openalex.org/W2065758186","https://openalex.org/W2092014767","https://openalex.org/W2104336575","https://openalex.org/W2108211019","https://openalex.org/W2122689321","https://openalex.org/W2125905426","https://openalex.org/W2129224561","https://openalex.org/W2131418871","https://openalex.org/W2133690701","https://openalex.org/W2155469840","https://openalex.org/W2158665370","https://openalex.org/W2162118597","https://openalex.org/W2166843422","https://openalex.org/W2491191486","https://openalex.org/W3023540311","https://openalex.org/W4212825216","https://openalex.org/W4239512904"],"related_works":["https://openalex.org/W2181520554","https://openalex.org/W2999775985","https://openalex.org/W2010210339","https://openalex.org/W2293846540","https://openalex.org/W2963700364","https://openalex.org/W3021758908","https://openalex.org/W2135099985","https://openalex.org/W2097641068","https://openalex.org/W2335546159","https://openalex.org/W1520899630"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"one-generator":[3],"binary":[4,51,64],"quasi-cyclic":[5],"(QC)":[6],"codes":[7,33,42,53,66,93,122,135],"are":[8,75],"explored":[9,44],"by":[10,77],"statistical":[11,26],"tools":[12],"derived":[13],"from":[14],"design":[15],"of":[16,25,39,67,105,133],"experiments.":[17],"A":[18],"connection":[19],"between":[20,48],"a":[21,46,79,87,110],"structured":[22],"cyclic":[23],"class":[24],"designs,":[27],"k-circulant":[28,58],"supersaturated":[29,59],"designs":[30,60],"and":[31,45,54,73],"QC":[32,52,65],"is":[34,43,61,84,118],"given.":[35],"The":[36],"mathematical":[37],"structure":[38],"the":[40,96,102,124,130,137],"later":[41],"link":[47],"complementary":[49],"dual":[50],"E(s":[55],"2":[56],")-optimal":[57],"established.":[62],"Moreover,":[63],"rate":[68],"1/3,":[69],"1/4,":[70],"1/5,":[71],"1/6":[72],"1/7":[74],"found":[76],"utilizing":[78],"genetic":[80],"algorithm.":[81],"Our":[82],"approach":[83],"based":[85],"on":[86,101,129],"search":[88],"for":[89],"good":[90],"or":[91],"best":[92],"that":[94,120],"attain":[95],"current":[97,125],"best-known":[98,126],"lower":[99,127],"bounds":[100,128],"minimum":[103,131],"distance":[104,132],"linear":[106,134],"codes,":[107],"formulated":[108],"as":[109],"combinatorial":[111],"optimization":[112],"problem.":[113],"Surveying":[114],"previous":[115],"results,":[116],"it":[117],"shown,":[119],"our":[121],"reach":[123],"with":[136],"same":[138],"parameters.":[139]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}