{"id":"https://openalex.org/W2896225583","doi":"https://doi.org/10.1109/tcomm.2018.2877460","title":"An Efficient Optimal Algorithm for the Successive Minima Problem","display_name":"An Efficient Optimal Algorithm for the Successive Minima Problem","publication_year":2018,"publication_date":"2018-10-22","ids":{"openalex":"https://openalex.org/W2896225583","doi":"https://doi.org/10.1109/tcomm.2018.2877460","mag":"2896225583"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2018.2877460","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2018.2877460","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","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/A5080664346","display_name":"Jinming Wen","orcid":"https://orcid.org/0000-0002-8181-0958"},"institutions":[{"id":"https://openalex.org/I159948400","display_name":"Jinan University","ror":"https://ror.org/02xe5ns62","country_code":"CN","type":"education","lineage":["https://openalex.org/I159948400"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jinming Wen","raw_affiliation_strings":["College of Information Science and Technology, and the College of Cyber Security, Jinan University, Guangzhou, China"],"raw_orcid":"https://orcid.org/0000-0002-8181-0958","affiliations":[{"raw_affiliation_string":"College of Information Science and Technology, and the College of Cyber Security, Jinan University, Guangzhou, China","institution_ids":["https://openalex.org/I159948400"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101813604","display_name":"Lanping Li","orcid":"https://orcid.org/0000-0003-3032-077X"},"institutions":[{"id":"https://openalex.org/I4800084","display_name":"Southwest Jiaotong University","ror":"https://ror.org/00hn7w693","country_code":"CN","type":"education","lineage":["https://openalex.org/I4800084"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lanping Li","raw_affiliation_strings":["Information Security and National Computing Grid Laboratory, Southwest Jiaotong University, Chengdu, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Security and National Computing Grid Laboratory, Southwest Jiaotong University, Chengdu, China","institution_ids":["https://openalex.org/I4800084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029840191","display_name":"Xiaohu Tang","orcid":"https://orcid.org/0000-0002-7938-7812"},"institutions":[{"id":"https://openalex.org/I4800084","display_name":"Southwest Jiaotong University","ror":"https://ror.org/00hn7w693","country_code":"CN","type":"education","lineage":["https://openalex.org/I4800084"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaohu Tang","raw_affiliation_strings":["Information Security and National Computing Grid Laboratory, Southwest Jiaotong University, Chengdu, China"],"raw_orcid":"https://orcid.org/0000-0002-7938-7812","affiliations":[{"raw_affiliation_string":"Information Security and National Computing Grid Laboratory, Southwest Jiaotong University, Chengdu, China","institution_ids":["https://openalex.org/I4800084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065074102","display_name":"Wai Ho Mow","orcid":"https://orcid.org/0000-0003-1804-0476"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Wai Ho Mow","raw_affiliation_strings":["Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":0.8997,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.74190459,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"67","issue":"2","first_page":"1424","last_page":"1436"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9997000098228455,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9997000098228455,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9997000098228455,"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.9991999864578247,"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/algorithm","display_name":"Algorithm","score":0.7280303835868835},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.7031071186065674},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49959373474121094},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.4854434132575989},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.47594714164733887},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.46637728810310364},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42005911469459534},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.364107608795166}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7280303835868835},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.7031071186065674},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49959373474121094},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.4854434132575989},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.47594714164733887},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.46637728810310364},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42005911469459534},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.364107608795166},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tcomm.2018.2877460","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2018.2877460","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"},{"id":"pmh:oai:repository.ust.hk:1783.1-95664","is_oa":false,"landing_page_url":"http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000458804400039","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:repository.ust.hk:1783.1-96648","is_oa":false,"landing_page_url":"http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=&rft.volume=67&rft.issue=2&rft.date=2019&rft.spage=1424&rft.aulast=Wen&rft.aufirst=Jinming&rft.atitle=An+Optimal+Algorithm+for+the+Successive+Minima+Problem&rft.title=IEEE+Transactions+on+Communications","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4515569331","display_name":"\u03b1-\u5f3a\u8870\u51cf\u7a00\u758f\u4fe1\u53f7\u91cd\u6784\u7406\u8bba\u7814\u7a76\u4e0e\u7b97\u6cd5\u8bbe\u8ba1","funder_award_id":"11871248","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G4872676131","display_name":null,"funder_award_id":"21618329","funder_id":"https://openalex.org/F4320335787","funder_display_name":"Fundamental Research Funds for the Central Universities"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320335787","display_name":"Fundamental Research Funds for the Central Universities","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W1698594463","https://openalex.org/W1954084529","https://openalex.org/W1966159401","https://openalex.org/W1969489987","https://openalex.org/W1973641217","https://openalex.org/W1973702654","https://openalex.org/W1989510734","https://openalex.org/W1991523744","https://openalex.org/W1994657427","https://openalex.org/W1997856676","https://openalex.org/W2010660042","https://openalex.org/W2020439727","https://openalex.org/W2035266863","https://openalex.org/W2062555860","https://openalex.org/W2077481023","https://openalex.org/W2078664266","https://openalex.org/W2098833556","https://openalex.org/W2101870477","https://openalex.org/W2119458444","https://openalex.org/W2123831057","https://openalex.org/W2126483728","https://openalex.org/W2140940105","https://openalex.org/W2141040012","https://openalex.org/W2147507815","https://openalex.org/W2156787051","https://openalex.org/W2195129092","https://openalex.org/W2342065431","https://openalex.org/W2405720353","https://openalex.org/W2492035247","https://openalex.org/W2569741146","https://openalex.org/W2605352268","https://openalex.org/W2889019540","https://openalex.org/W2963210472","https://openalex.org/W2964101532","https://openalex.org/W2964187361","https://openalex.org/W3098943005","https://openalex.org/W3108445493","https://openalex.org/W3125267404","https://openalex.org/W4300123980","https://openalex.org/W4312258136","https://openalex.org/W6713585013","https://openalex.org/W6754407461"],"related_works":["https://openalex.org/W2064374770","https://openalex.org/W2119189212","https://openalex.org/W2382759697","https://openalex.org/W1971798384","https://openalex.org/W1999796601","https://openalex.org/W2989992239","https://openalex.org/W2165711691","https://openalex.org/W2893305893","https://openalex.org/W2120201513","https://openalex.org/W2060654563"],"abstract_inverted_index":{"In":[0,35,130],"many":[1],"applications,":[2],"including":[3],"integer-forcing":[4],"linear":[5],"multiple-input":[6],"and":[7,182],"multiple-output":[8],"(MIMO)":[9],"receiver":[10],"design,":[11],"one":[12],"needs":[13],"to":[14,25,178],"solve":[15],"a":[16,63,72,98,109],"successive":[17],"minima":[18],"problem":[19],"(SMP)":[20],"on":[21],"an":[22,27,41,47],"n-dimensional":[23],"lattice":[24],"get":[26],"optimal":[28,43],"integer":[29],"coefficient":[30],"matrix":[31],"A*":[32,83,92],"\u2208":[33],"Zn\u00d7n.":[34],"this":[36],"paper,":[37],"we":[38,125,132],"first":[39,60],"propose":[40],"efficient":[42,147,162,166],"SMP":[44,187],"algorithm":[45,57,74,107,139,149,168],"with":[46,62,75,150,169],"O(n2)":[48,77],"memory":[49,152,171],"complexity.":[50,129,172],"The":[51],"main":[52],"idea":[53],"behind":[54],"the":[55,105,118,121,137,145,164,180],"new":[56,106,138],"is":[58,68,84,140,159],"it":[59,158],"initializes":[61],"suitable":[64],"suboptimal":[65],"solution,":[66],"which":[67,90],"then":[69,115],"updated":[70],"via":[71],"novel":[73,186],"only":[76,134],"flops":[78],"in":[79],"each":[80],"updating,":[81],"until":[82],"obtained.":[85],"Different":[86],"from":[87],"existing":[88,148,167],"algorithms":[89],"find":[91],"column":[93,95],"by":[94],"through":[96],"using":[97],"sphere":[99],"decoding":[100],"search":[101,110],"strategy":[102,111],"n":[103],"times,":[104],"uses":[108],"once":[112],"only.":[113],"We":[114],"rigorously":[116],"prove":[117],"optimality":[119,181],"of":[120,184],"proposed":[122],"algorithm.":[123,188],"Furthermore,":[124],"theoretically":[126],"analyze":[127],"its":[128],"particular,":[131],"not":[133],"show":[135],"that":[136,157],"\u03a9(n)":[141],"times":[142],"faster":[143],"than":[144,163],"most":[146,165],"polynomial":[151],"complexity,":[153],"but":[154],"also":[155],"assert":[156],"even":[160],"more":[161],"exponential":[170],"Finally,":[173],"numerical":[174],"simulations":[175],"are":[176],"presented":[177],"illustrate":[179],"efficiency":[183],"our":[185]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}