{"id":"https://openalex.org/W2258418267","doi":"https://doi.org/10.1109/isit.2016.7541718","title":"A linearithmic time algorithm for a shortest vector problem in compute-and-forward design","display_name":"A linearithmic time algorithm for a shortest vector problem in compute-and-forward design","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2258418267","doi":"https://doi.org/10.1109/isit.2016.7541718","mag":"2258418267"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541718","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541718","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1602.00169","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064565201","display_name":"Jinming Wen","orcid":"https://orcid.org/0000-0002-9277-6038"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Jinming Wen","raw_affiliation_strings":["ENS de Lyon, LIP, (CNRS, ENS de Lyon, Inria, UCBL), 69007, France","Arithmetic and Computing"],"affiliations":[{"raw_affiliation_string":"ENS de Lyon, LIP, (CNRS, ENS de Lyon, Inria, UCBL), 69007, France","institution_ids":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Arithmetic and Computing","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062087251","display_name":"Xiao-Wen Chang","orcid":"https://orcid.org/0000-0001-9251-2959"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Xiao-Wen Chang","raw_affiliation_strings":["School of Computer Science, McGill University, Montreal, H3A 2A7, Canada","McGill University"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, McGill University, Montreal, H3A 2A7, Canada","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"McGill University","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064565201"],"corresponding_institution_ids":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590"],"apc_list":null,"apc_paid":null,"fwci":0.7237,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73655213,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2344","last_page":"2348"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9955999851226807,"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.9943000078201294,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.7247570753097534},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6330168843269348},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5550265908241272},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.48824742436408997},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.42196372151374817},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33486682176589966},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3051634430885315},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27851563692092896},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12980946898460388}],"concepts":[{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.7247570753097534},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6330168843269348},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5550265908241272},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.48824742436408997},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.42196372151374817},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33486682176589966},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3051634430885315},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27851563692092896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12980946898460388},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/isit.2016.7541718","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541718","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1602.00169","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1602.00169","pdf_url":"https://arxiv.org/pdf/1602.00169","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-01403929v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01403929","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2016","raw_type":"Preprints, Working Papers, ..."},{"id":"doi:10.48550/arxiv.1602.00169","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1602.00169","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1602.00169","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1602.00169","pdf_url":"https://arxiv.org/pdf/1602.00169","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W57720693","https://openalex.org/W1588051003","https://openalex.org/W1742003405","https://openalex.org/W2005196269","https://openalex.org/W2012589104","https://openalex.org/W2047051870","https://openalex.org/W2053291409","https://openalex.org/W2081227487","https://openalex.org/W2126483728","https://openalex.org/W2140940105","https://openalex.org/W2963524361","https://openalex.org/W2964101532","https://openalex.org/W6785414630"],"related_works":["https://openalex.org/W3183360588","https://openalex.org/W4253588386","https://openalex.org/W2810620529","https://openalex.org/W2367648025","https://openalex.org/W2395868876","https://openalex.org/W4313182153","https://openalex.org/W2352589493","https://openalex.org/W2462581792","https://openalex.org/W3200343262","https://openalex.org/W2387829241"],"abstract_inverted_index":{"We":[0],"modify":[1],"the":[2,37,40,49],"algorithm":[3,13,44],"proposed":[4],"by":[5],"Sahraei":[6],"et":[7],"al.":[8],"in":[9,31],"2015,":[10],"resulting":[11],"an":[12],"with":[14,53],"expected":[15],"complexity":[16],"of":[17,39],"O(n":[18],"log":[19],"n)":[20],"arithmetic":[21],"operations":[22],"to":[23],"solve":[24],"a":[25],"special":[26],"shortest":[27],"vector":[28],"problem":[29],"arising":[30],"computer-and-forward":[32],"design,":[33],"where":[34],"n":[35],"is":[36,45],"dimension":[38],"channel":[41],"vector.":[42],"This":[43],"more":[46],"efficient":[47],"than":[48],"best":[50],"known":[51],"algorithms":[52],"proved":[54],"complexity.":[55]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-21T06:30:42.041108","created_date":"2025-10-10T00:00:00"}