{"id":"https://openalex.org/W2543456536","doi":"https://doi.org/10.1109/itw.2016.7606870","title":"Sub-linear time compressed sensing for support recovery using left and right regular sparse-graph codes","display_name":"Sub-linear time compressed sensing for support recovery using left and right regular sparse-graph codes","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2543456536","doi":"https://doi.org/10.1109/itw.2016.7606870","mag":"2543456536"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2016.7606870","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2016.7606870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-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/A5024678587","display_name":"Avinash Vem","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Avinash Vem","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Texas A&M University, College Station, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080949272","display_name":"Nagaraj Thenkarai Janakiraman","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nagaraj Thenkarai Janakiraman","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Texas A&M University, College Station, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010169197","display_name":"Krishna R. Narayanan","orcid":"https://orcid.org/0000-0001-8742-5332"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Krishna Narayanan","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Texas A&M University, College Station, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.11379457,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"429","last_page":"433"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9958000183105469,"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/T10125","display_name":"Advanced Wireless Communication Techniques","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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6618075966835022},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5903221368789673},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5540927648544312},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5095834732055664},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.5083233714103699},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.50801682472229},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5071415901184082},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4878416061401367},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.42936769127845764},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4270361661911011},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.4148560166358948},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4105435013771057},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37565726041793823},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3101234436035156},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09421807527542114}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6618075966835022},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5903221368789673},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5540927648544312},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5095834732055664},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.5083233714103699},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.50801682472229},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5071415901184082},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4878416061401367},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.42936769127845764},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4270361661911011},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.4148560166358948},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4105435013771057},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37565726041793823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3101234436035156},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09421807527542114},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2016.7606870","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2016.7606870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1536930200","https://openalex.org/W1672894909","https://openalex.org/W2140466267","https://openalex.org/W2141556672"],"related_works":["https://openalex.org/W2737338842","https://openalex.org/W3005946484","https://openalex.org/W4377371889","https://openalex.org/W2089134982","https://openalex.org/W4299305030","https://openalex.org/W2040347389","https://openalex.org/W2113270940","https://openalex.org/W2521054645","https://openalex.org/W4389820491","https://openalex.org/W2018076478"],"abstract_inverted_index":{"In":[0],"[1],":[1],"[2],":[2],"two":[3],"schemes":[4,22,38,92],"have":[5],"been":[6],"proposed":[7],"to":[8,93],"recover":[9],"the":[10,37,44,52,73,85,94],"support":[11],"of":[12,87,90,97,104],"a":[13,31],"K-sparse":[14],"N-dimensional":[15],"signal":[16],"from":[17],"noisy":[18],"linear":[19],"measurements.":[20],"Both":[21,36],"use":[23],"left-regular":[24,74],"sparse-graph":[25],"code":[26],"based":[27],"sensing":[28],"matrices":[29],"and":[30,43,78,108],"simple":[32],"peeling-based":[33],"decoding":[34,102],"algorithm.":[35],"require":[39,47],"O(K":[40,56,98,105],"logN)":[41,49,57],"measurements":[42,88],"first":[45],"scheme":[46,54],"O(N":[48,109],"computations":[50,58],"whereas":[51],"second":[53],"requires":[55],"(sub-linear":[59],"time":[60],"complexity":[61],"when":[62],"K":[63],"is":[64],"sub-linear":[65],"in":[66],"N).":[67],"We":[68],"show":[69],"that":[70],"by":[71],"replacing":[72],"ensemble":[75],"with":[76,101],"left":[77],"right":[79],"regular":[80],"ensemble,":[81],"we":[82],"can":[83],"reduce":[84],"number":[86],"required":[89],"these":[91],"optimal":[95],"order":[96],"log":[99,106,110],"N/K)":[100,107],"complexities":[103],"N/K),":[111],"respectively.":[112]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}