{"id":"https://openalex.org/W2985242569","doi":null,"title":"A Hierarchical-based Greedy Algorithm for Echelon-Ferrers Construction","display_name":"A Hierarchical-based Greedy Algorithm for Echelon-Ferrers Construction","alternate_titles":[],"publication_year":2019,"publication_date":"2019-11-04","ids":{"openalex":"https://openalex.org/W2985242569","mag":"2985242569"},"language":"en","primary_location":{"id":"mag:2985242569","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/1911.00508","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2985242569"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/abs/1911.00508","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079769529","display_name":"Xianmang He","orcid":"https://orcid.org/0000-0002-6893-6476","observed_orcids":["https://orcid.org/0000-0002-6893-6476"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xianmang He","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-6893-6476","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5079769529"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.0031999999191612005,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subspace-codes","display_name":"subspace codes","score":0.8840000033378601},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.8859999775886536},{"id":"https://openalex.org/keywords/hierarchical-construction","display_name":"hierarchical construction","score":0.5450000166893005},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.7540000081062317},{"id":"https://openalex.org/keywords/k","display_name":"K","score":0.7919999957084656},{"id":"https://openalex.org/keywords/finite-fields","display_name":"finite fields","score":0.5979999899864197},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"minimum distance","score":0.48899999260902405}],"concepts":[{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.7889965772628784},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6556114554405212},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.643460750579834},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5743110775947571},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5639544725418091},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5291830897331238},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5081217288970947},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4833326041698456},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4115334749221802},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3748246729373932},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3689662218093872},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3602010905742645},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0907973051071167},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07515543699264526},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2985242569","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/1911.00508","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null}],"best_oa_location":{"id":"mag:2985242569","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/1911.00508","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4206715203","https://openalex.org/W3010239186","https://openalex.org/W7167418337","https://openalex.org/W3030603290","https://openalex.org/W4403603099","https://openalex.org/W4410530735","https://openalex.org/W1749635230","https://openalex.org/W7130652000","https://openalex.org/W2964084534","https://openalex.org/W1612542575"],"abstract_inverted_index":{"Echelon-Ferrers":[0],"is":[1],"one":[2],"of":[3,38,69,93],"important":[4],"techniques":[5],"to":[6,9,35,61],"help":[7],"researchers":[8],"improve":[10,62],"lower":[11,64],"bounds":[12,65,95,100],"for":[13,26,41,51,66],"subspace":[14,71],"code.":[15],"But,":[16],"unfortunately,":[17],"heavy":[18],"computation":[19],"has":[20],"been":[21],"paid":[22],"as":[23],"the":[24,27,48,63,91,102],"cost":[25],"construction.":[28],"In":[29],"this":[30],"paper,":[31],"we":[32],"show":[33],"how":[34],"attain":[36],"codes":[37],"larger":[39],"size":[40],"a":[42],"given":[43],"minimum":[44],"distance":[45],"d":[46],"by":[47],"greedy":[49],"algorithm":[50,58],"echelon-Ferrers":[52],"construction":[53],"introduced":[54],"in":[55],"[1].":[56],"This":[57],"allows":[59],"us":[60],"several":[67],"types":[68],"constant-dimension":[70],"codes,":[72],"including":[73],"Aq(15;":[74],"6;":[75,78,82],"6),":[76,79],"Aq(16;":[77,81],"and":[80,90],"7)":[83],"etc.":[84],"More":[85],"than":[86],"56":[87],"new":[88],"improvements":[89],"expression":[92],"these":[94,99],"are":[96],"given.":[97],"All":[98],"exceeds":[101],"current":[103],"best":[104],"bounds.":[105]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2985242569","counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2016,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2019-11-22T00:00:00"}
