{"id":"https://openalex.org/W2037795929","doi":"https://doi.org/10.1109/isit.2012.6283954","title":"Applications of the Shannon-Hartley theorem to data streams and sparse recovery","display_name":"Applications of the Shannon-Hartley theorem to data streams and sparse recovery","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2037795929","doi":"https://doi.org/10.1109/isit.2012.6283954","mag":"2037795929"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2012.6283954","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6283954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","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/A5083990461","display_name":"Eric Price","orcid":"https://orcid.org/0000-0002-3480-8054"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Eric Price","raw_affiliation_strings":["MIT, USA"],"affiliations":[{"raw_affiliation_string":"MIT, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102861589","display_name":"David P. Woodruff","orcid":"https://orcid.org/0000-0002-2158-1380"},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David P. Woodruff","raw_affiliation_strings":["IBM Almaden Research Center, USA"],"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center, USA","institution_ids":["https://openalex.org/I4210085935"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083990461"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.8473,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.92998999,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2446","last_page":"2450"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"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":1.0,"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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9994000196456909,"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5827018618583679},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4957340657711029},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.489341676235199},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4721541404724121},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.41685739159584045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38155099749565125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3797505497932434},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37051451206207275},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.17886283993721008},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1409531533718109},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.12654277682304382}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5827018618583679},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4957340657711029},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.489341676235199},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4721541404724121},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.41685739159584045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38155099749565125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3797505497932434},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37051451206207275},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.17886283993721008},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1409531533718109},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.12654277682304382},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2012.6283954","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6283954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.8527","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.8527","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mit.edu/~ecprice/papers/isit.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.309.1638","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.1638","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://researcher.watson.ibm.com/researcher/files/us-dpwoodru/pw12.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1493892051","https://openalex.org/W1512493349","https://openalex.org/W1522285917","https://openalex.org/W1582057136","https://openalex.org/W1674742109","https://openalex.org/W1991099830","https://openalex.org/W2020301027","https://openalex.org/W2080745194","https://openalex.org/W2091904714","https://openalex.org/W2107917944","https://openalex.org/W2109379066","https://openalex.org/W2120383799","https://openalex.org/W2129569662","https://openalex.org/W2141556672","https://openalex.org/W2145096794","https://openalex.org/W2149565746","https://openalex.org/W2167099561","https://openalex.org/W2167396179","https://openalex.org/W2168831133","https://openalex.org/W2259091399","https://openalex.org/W2486578931","https://openalex.org/W2949204716","https://openalex.org/W2964253263","https://openalex.org/W3022037017","https://openalex.org/W3101990100","https://openalex.org/W4248301666","https://openalex.org/W6629496199","https://openalex.org/W6630736070","https://openalex.org/W6631211210","https://openalex.org/W6684190856","https://openalex.org/W6989074518"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W1972035260","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W1991411408","https://openalex.org/W2066456778"],"abstract_inverted_index":{"The":[0],"Shannon-Hartley":[1],"theorem":[2,35],"bounds":[3],"the":[4,20,23,55,63,86,93,103],"maximum":[5],"rate":[6],"at":[7],"which":[8,76],"information":[9],"can":[10],"be":[11],"transmitted":[12],"over":[13],"a":[14,42,68,73],"Gaussian":[15],"channel":[16],"in":[17,36,67],"terms":[18],"of":[19,22,33,46,57,88],"ratio":[21],"signal":[24],"to":[25,61,91],"noise":[26],"power.":[27],"We":[28,118],"show":[29,72,84],"two":[30],"unexpected":[31],"applications":[32],"this":[34,80,120],"computer":[37],"science:":[38],"(1)":[39],"we":[40,83],"give":[41],"much":[43],"simpler":[44],"proof":[45],"an":[47,98,123],"\u03a9(\u03b7":[48],"<sup":[49],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[50,107,111],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1-2/\u03c1</sup>":[51],")":[52],"bound":[53],"on":[54,97],"number":[56,87],"linear":[58],"measurements":[59,89],"required":[60],"approximate":[62],"p-th":[64],"frequency":[65],"moment":[66],"data":[69],"stream,":[70],"and":[71],"new":[74],"distribution":[75],"is":[77,114],"hard":[78],"for":[79],"problem,":[81],"(2)":[82],"that":[85],"needed":[90],"solve":[92],"k-sparse":[94],"recovery":[95],"problem":[96],"n-dimensional":[99],"vector":[100],"x":[101],"with":[102,122],"C-approximate":[104],"\u2113":[105],"<sub":[106,110],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[108,112],"/\u2113":[109],"guarantee":[113],"\u03a9(k":[115],"log(n/k)/log":[116,129],"C).":[117],"complement":[119],"result":[121],"almost":[124],"matching":[125],"O(k":[126],"log*":[127],"k":[128],"C)":[130],"upper":[131],"bound.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}