{"id":"https://openalex.org/W2130340248","doi":"https://doi.org/10.1109/isit.2009.5205850","title":"Construction and covering properties of constant-dimension codes","display_name":"Construction and covering properties of constant-dimension codes","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2130340248","doi":"https://doi.org/10.1109/isit.2009.5205850","mag":"2130340248"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205850","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205850","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1158160","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037486046","display_name":"Maximilien Gadouleau","orcid":"https://orcid.org/0000-0003-4701-738X"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Maximilien Gadouleau","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Lehigh University, PA, USA","Department of Electrical and Computer Engineering, Lehigh University, PA 18015, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, PA, USA","institution_ids":["https://openalex.org/I186143895"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, PA 18015, USA","institution_ids":["https://openalex.org/I186143895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101582861","display_name":"Zhiyuan Yan","orcid":"https://orcid.org/0000-0003-2286-2771"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhiyuan Yan","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Lehigh University, PA, USA","Department of Electrical and Computer Engineering, Lehigh University, PA 18015, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, PA, USA","institution_ids":["https://openalex.org/I186143895"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, PA 18015, USA","institution_ids":["https://openalex.org/I186143895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037486046"],"corresponding_institution_ids":["https://openalex.org/I186143895"],"apc_list":null,"apc_paid":null,"fwci":4.3506,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.94704479,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"4","issue":null,"first_page":"2221","last_page":"2225"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":1.0,"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"}},{"id":"https://openalex.org/T11458","display_name":"Advanced Wireless Communication Technologies","score":0.9692000150680542,"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/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9509999752044678,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6335583925247192},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6194348335266113},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6008158922195435},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5783119201660156},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5499613881111145},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49825167655944824},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.49819016456604004},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4975619614124298},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.47298797965049744},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4445464015007019},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.44436320662498474},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4364428222179413},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4101138114929199},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4050248861312866},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40093740820884705},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2871593236923218}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6335583925247192},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6194348335266113},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6008158922195435},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5783119201660156},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5499613881111145},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49825167655944824},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.49819016456604004},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4975619614124298},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.47298797965049744},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4445464015007019},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.44436320662498474},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4364428222179413},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4101138114929199},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4050248861312866},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40093740820884705},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2871593236923218},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2009.5205850","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205850","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.244.2871","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.244.2871","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0903.2675v1.pdf","raw_type":"text"},{"id":"pmh:oai:durham-repository.worktribe.com:1158160","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1158160","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1158160","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1158160","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W177399933","https://openalex.org/W785083160","https://openalex.org/W1568510176","https://openalex.org/W1608472120","https://openalex.org/W1985627461","https://openalex.org/W1990992471","https://openalex.org/W1993359877","https://openalex.org/W2030288698","https://openalex.org/W2048235391","https://openalex.org/W2053524063","https://openalex.org/W2055060019","https://openalex.org/W2083270107","https://openalex.org/W2095547380","https://openalex.org/W2101520088","https://openalex.org/W2114044186","https://openalex.org/W2116220645","https://openalex.org/W2118456153","https://openalex.org/W2125838758","https://openalex.org/W2128555802","https://openalex.org/W2129429315","https://openalex.org/W2130340248","https://openalex.org/W2135469284","https://openalex.org/W2135643259","https://openalex.org/W2138033161","https://openalex.org/W2139416652","https://openalex.org/W2141699149","https://openalex.org/W2147101953","https://openalex.org/W2158610833","https://openalex.org/W2167614100","https://openalex.org/W2534491645","https://openalex.org/W3101800757","https://openalex.org/W3103260357","https://openalex.org/W3140093529","https://openalex.org/W4298236575","https://openalex.org/W6636334098"],"related_works":["https://openalex.org/W3017203753","https://openalex.org/W3083229674","https://openalex.org/W4205451769","https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W3096151594","https://openalex.org/W2964031101","https://openalex.org/W4200209838","https://openalex.org/W2165241191","https://openalex.org/W2798867000"],"abstract_inverted_index":{"Constant-dimension":[0],"codes":[1,88,163,176],"(CDCs)":[2],"have":[3,164],"been":[4],"investigated":[5],"for":[6,84,91],"noncoherent":[7],"error":[8],"correction":[9],"in":[10],"random":[11],"network":[12],"coding.":[13],"The":[14],"maximum":[15],"cardinality":[16,137],"of":[17,57,109,112,120,128,138,152,160,173,191],"CDCs":[18,28,34,58,187],"with":[19,141],"given":[20,143],"minimum":[21,136],"distance":[22,104],"and":[23,146,170],"how":[24],"to":[25,41,64],"construct":[26,53,184],"optimal":[27,179],"are":[29,45,71,177],"both":[30],"open":[31],"problems,":[32],"although":[33],"obtained":[35],"by":[36,106,188],"lifting":[37],"Gabidulin":[38],"codes,":[39,44,62,68],"referred":[40,63],"as":[42,65],"KK":[43,61,67,87,92,115],"nearly":[46],"optimal.":[47],"In":[48,117],"this":[49,153],"paper,":[50],"we":[51,123,156,183],"first":[52,131],"a":[54,80,101,139,142],"new":[55],"class":[56],"based":[59],"on":[60,134],"augmented":[66,86,114],"whose":[69],"cardinalities":[70],"greater":[72],"than":[73,100],"previously":[74],"proposed":[75],"CDCs.":[76,129,181],"We":[77,130],"then":[78,147],"propose":[79],"low-complexity":[81],"decoding":[82,95],"algorithm":[83,96],"our":[85,113],"using":[89],"that":[90,158],"codes.":[93,116,194],"Our":[94],"corrects":[97],"more":[98],"errors":[99],"bounded":[102],"subspace":[103],"decoder":[105],"taking":[107],"advantage":[108],"the":[110,118,121,125,135,149,165],"structure":[111],"rest":[119],"paper":[122],"investigate":[124],"covering":[126,144,168,186],"properties":[127],"derive":[132],"bounds":[133],"CDC":[140],"radius":[145],"determine":[148],"asymptotic":[150],"behavior":[151],"quantity.":[154],"Moreover,":[155],"show":[157],"liftings":[159,172,190],"rank":[161,174,192],"metric":[162,175,193],"highest":[166],"possible":[167],"radius,":[169],"hence":[171],"not":[178],"packing":[180],"Finally,":[182],"good":[185],"permuting":[189]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}