{"id":"https://openalex.org/W4289655311","doi":"https://doi.org/10.1109/isit50566.2022.9834397","title":"Computing Upper and Lower Bounds for the Bandwidth of Bandlimited Signals","display_name":"Computing Upper and Lower Bounds for the Bandwidth of Bandlimited Signals","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655311","doi":"https://doi.org/10.1109/isit50566.2022.9834397"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834397","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834397","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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/A5000732219","display_name":"Holger Boche","orcid":"https://orcid.org/0000-0002-8375-8946"},"institutions":[{"id":"https://openalex.org/I4210142743","display_name":"Munich Center for Quantum Science and Technology","ror":"https://ror.org/04xrcta15","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210142743","https://openalex.org/I8204097"]},{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]},{"id":"https://openalex.org/I904495901","display_name":"Ruhr University Bochum","ror":"https://ror.org/04tsk2644","country_code":"DE","type":"education","lineage":["https://openalex.org/I904495901"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Holger Boche","raw_affiliation_strings":["Technical University of Munich,Lehrstuhl für Theoretische Informationstechnik,Germany","Excellence Cluster for Cyber Security in the Age of Large-Scale Adversaries (CASA), Ruhr University, Bochum, Germany","Munich Center for Quantum Science and Technology (MCQST)"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich,Lehrstuhl für Theoretische Informationstechnik,Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"Excellence Cluster for Cyber Security in the Age of Large-Scale Adversaries (CASA), Ruhr University, Bochum, Germany","institution_ids":["https://openalex.org/I904495901"]},{"raw_affiliation_string":"Munich Center for Quantum Science and Technology (MCQST)","institution_ids":["https://openalex.org/I4210142743"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019862720","display_name":"Ullrich J. M\u00f6nich","orcid":"https://orcid.org/0000-0002-2390-7524"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ullrich J. M\u00f6nich","raw_affiliation_strings":["Technical University of Munich,Lehrstuhl für Theoretische Informationstechnik,Germany"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich,Lehrstuhl für Theoretische Informationstechnik,Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032791971","display_name":"Yannik B\u00f6ck","orcid":"https://orcid.org/0000-0001-7640-6988"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Yannik N. B\u00f6ck","raw_affiliation_strings":["Technical University of Munich,Lehrstuhl für Theoretische Informationstechnik,Germany"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich,Lehrstuhl für Theoretische Informationstechnik,Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000732219"],"corresponding_institution_ids":["https://openalex.org/I4210142743","https://openalex.org/I62916508","https://openalex.org/I904495901"],"apc_list":null,"apc_paid":null,"fwci":0.5219,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.53996737,"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":"1600","last_page":"1605"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9970999956130981,"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/T11567","display_name":"semigroups and automata theory","score":0.9898999929428101,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bandlimiting","display_name":"Bandlimiting","score":0.9579504728317261},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.7533277273178101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6529825925827026},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.649858832359314},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6263460516929626},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46559035778045654},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.4489061236381531},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.43193864822387695},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.396634966135025},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3506211042404175},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.329393208026886},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.1782883107662201},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.1202923059463501},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10684117674827576}],"concepts":[{"id":"https://openalex.org/C129997835","wikidata":"https://www.wikidata.org/wiki/Q806263","display_name":"Bandlimiting","level":3,"score":0.9579504728317261},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.7533277273178101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6529825925827026},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.649858832359314},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6263460516929626},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46559035778045654},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.4489061236381531},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.43193864822387695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.396634966135025},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3506211042404175},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.329393208026886},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1782883107662201},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.1202923059463501},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10684117674827576},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834397","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834397","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320311687","display_name":"Ministry of Education","ror":"https://ror.org/03m01yf64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1485161910","https://openalex.org/W1497475168","https://openalex.org/W1540715591","https://openalex.org/W1552300625","https://openalex.org/W1827134935","https://openalex.org/W2022731279","https://openalex.org/W2023778211","https://openalex.org/W2040275951","https://openalex.org/W2096358753","https://openalex.org/W2126160338","https://openalex.org/W2131909533","https://openalex.org/W2138657277","https://openalex.org/W2139399084","https://openalex.org/W2141341167","https://openalex.org/W2153002160","https://openalex.org/W2163081291","https://openalex.org/W2735109901","https://openalex.org/W2936292392","https://openalex.org/W2946909655","https://openalex.org/W2947899053","https://openalex.org/W2976821583","https://openalex.org/W2991512750","https://openalex.org/W3001380073","https://openalex.org/W3015676850","https://openalex.org/W3015820961","https://openalex.org/W3023478445","https://openalex.org/W3099242402","https://openalex.org/W3126309056","https://openalex.org/W4232277851","https://openalex.org/W4243563333","https://openalex.org/W4252713891","https://openalex.org/W4292793850","https://openalex.org/W4321319024","https://openalex.org/W4388315674","https://openalex.org/W6810821716"],"related_works":["https://openalex.org/W2912644765","https://openalex.org/W780939851","https://openalex.org/W4212859565","https://openalex.org/W4285151644","https://openalex.org/W1492522538","https://openalex.org/W1516047453","https://openalex.org/W4232804070","https://openalex.org/W2138521431","https://openalex.org/W1575782954","https://openalex.org/W2921577810"],"abstract_inverted_index":{"The":[0],"bandwidth":[1,31,72,115],"of":[2,12,29,32,42,73,94,116],"a":[3,57,82],"signal":[4,16],"is":[5,11,49,101,123],"an":[6],"important":[7],"physical":[8],"property":[9],"that":[10,65,121],"relevance":[13],"in":[14,126],"many":[15],"processing":[17],"applications.":[18],"In":[19,85],"this":[20,36,86,122],"paper":[21],"we":[22,38,88],"study":[23],"questions":[24],"related":[25],"to":[26,105],"the":[27,30,40,70,90,113],"computability":[28],"bandlimited":[33,68,95],"signals.":[34],"To":[35],"end":[37],"employ":[39],"concept":[41],"Turing":[43],"computability,":[44],"which":[45,74],"exactly":[46],"describes":[47],"what":[48],"theoretically":[50],"feasible":[51],"and":[52,97],"can":[53],"be":[54,76],"computed":[55,80],"on":[56,81],"digital":[58,83],"machine.":[59,84],"Recently,":[60],"it":[61,100],"has":[62],"been":[63],"shown":[64],"there":[66],"exist":[67],"signals,":[69],"actual":[71,114],"cannot":[75],"algorithmically":[77],"determined,":[78],"i.e.,":[79],"work,":[87],"consider":[89],"most":[91],"general":[92],"class":[93],"signals":[96],"analyze":[98],"whether":[99],"at":[102],"least":[103],"possible":[104,125],"compute":[106],"nontrivial":[107],"upper":[108],"or":[109],"lower":[110],"bounds":[111],"for":[112],"its":[117],"members.":[118],"We":[119],"show":[120],"not":[124],"general.":[127]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}