{"id":"https://openalex.org/W2922082951","doi":"https://doi.org/10.23919/isita.2018.8664399","title":"Lower Bound-oriented Parameter Calculation for AN Coding","display_name":"Lower Bound-oriented Parameter Calculation for AN Coding","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2922082951","doi":"https://doi.org/10.23919/isita.2018.8664399","mag":"2922082951"},"language":"en","primary_location":{"id":"doi:10.23919/isita.2018.8664399","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://tud.qucosa.de/id/qucosa%3A82177","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024082989","display_name":"Juliana Hildebrandt","orcid":"https://orcid.org/0000-0001-7198-8552"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Juliana Hildebrandt","raw_affiliation_strings":["Database Systems Group, Technische Universit\u00e4t Dresden, Dresden"],"affiliations":[{"raw_affiliation_string":"Database Systems Group, Technische Universit\u00e4t Dresden, Dresden","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045885297","display_name":"Till Kolditz","orcid":"https://orcid.org/0000-0002-1661-2488"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Till Kolditz","raw_affiliation_strings":["Database Systems Group, Technische Universit\u00e4t Dresden, Dresden"],"affiliations":[{"raw_affiliation_string":"Database Systems Group, Technische Universit\u00e4t Dresden, Dresden","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057703543","display_name":"Dirk Habich","orcid":"https://orcid.org/0000-0002-8671-5466"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dirk Habich","raw_affiliation_strings":["Database Systems Group, Technische Universit\u00e4t Dresden, Dresden"],"affiliations":[{"raw_affiliation_string":"Database Systems Group, Technische Universit\u00e4t Dresden, Dresden","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063512642","display_name":"Wolfgang Lehner","orcid":"https://orcid.org/0000-0001-8107-2775"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Wolfgang Lehner","raw_affiliation_strings":["Database Systems Group, Technische Universit\u00e4t Dresden, Dresden"],"affiliations":[{"raw_affiliation_string":"Database Systems Group, Technische Universit\u00e4t Dresden, Dresden","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5024082989"],"corresponding_institution_ids":["https://openalex.org/I78650965"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18001743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"590","last_page":"594"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11005","display_name":"Radiation Effects in Electronics","score":0.9998999834060669,"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/T11005","display_name":"Radiation Effects in Electronics","score":0.9998999834060669,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9994999766349792,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/hamming-distance","display_name":"Hamming distance","score":0.7373814582824707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7030633091926575},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6652255654335022},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.6470299363136292},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.6073436737060547},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.5711413621902466},{"id":"https://openalex.org/keywords/word-length","display_name":"Word length","score":0.5711379051208496},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5637223124504089},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5536900758743286},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.5089666843414307},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.4719604253768921},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4582187235355377},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.4396047294139862},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4297979176044464},{"id":"https://openalex.org/keywords/arithmetic-coding","display_name":"Arithmetic coding","score":0.42246460914611816},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.21993938088417053},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.19727280735969543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1846112608909607},{"id":"https://openalex.org/keywords/context-adaptive-binary-arithmetic-coding","display_name":"Context-adaptive binary arithmetic coding","score":0.17780306935310364},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10662171244621277},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08257967233657837}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7373814582824707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7030633091926575},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6652255654335022},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.6470299363136292},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.6073436737060547},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.5711413621902466},{"id":"https://openalex.org/C3019641298","wikidata":"https://www.wikidata.org/wiki/Q625642","display_name":"Word length","level":2,"score":0.5711379051208496},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5637223124504089},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5536900758743286},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.5089666843414307},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.4719604253768921},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4582187235355377},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.4396047294139862},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4297979176044464},{"id":"https://openalex.org/C153338461","wikidata":"https://www.wikidata.org/wiki/Q2651","display_name":"Arithmetic coding","level":4,"score":0.42246460914611816},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.21993938088417053},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.19727280735969543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1846112608909607},{"id":"https://openalex.org/C175732694","wikidata":"https://www.wikidata.org/wiki/Q1128713","display_name":"Context-adaptive binary arithmetic coding","level":3,"score":0.17780306935310364},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10662171244621277},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08257967233657837},{"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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.23919/isita.2018.8664399","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","raw_type":"proceedings-article"},{"id":"pmh:oai:qucosa:de:qucosa:82177","is_oa":true,"landing_page_url":"https://tud.qucosa.de/id/qucosa%3A82177","pdf_url":null,"source":{"id":"https://openalex.org/S4377196312","display_name":"Qucosa (Saxon State and University Library Dresden)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I3132420320","host_organization_name":"SLUB Dresden","host_organization_lineage":["https://openalex.org/I3132420320"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doc-type:Text"}],"best_oa_location":{"id":"pmh:oai:qucosa:de:qucosa:82177","is_oa":true,"landing_page_url":"https://tud.qucosa.de/id/qucosa%3A82177","pdf_url":null,"source":{"id":"https://openalex.org/S4377196312","display_name":"Qucosa (Saxon State and University Library Dresden)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I3132420320","host_organization_name":"SLUB Dresden","host_organization_lineage":["https://openalex.org/I3132420320"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doc-type:Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W366168198","https://openalex.org/W1523046361","https://openalex.org/W1998730330","https://openalex.org/W2008960744","https://openalex.org/W2081215702","https://openalex.org/W2093980096","https://openalex.org/W2125169487","https://openalex.org/W2134047166","https://openalex.org/W2157116240","https://openalex.org/W2294810545","https://openalex.org/W2521810108","https://openalex.org/W2593313312","https://openalex.org/W2623345574","https://openalex.org/W2799157244","https://openalex.org/W4245276998","https://openalex.org/W4246794227","https://openalex.org/W6631297419","https://openalex.org/W6734500129","https://openalex.org/W6827069628"],"related_works":["https://openalex.org/W2943247777","https://openalex.org/W2740543340","https://openalex.org/W2371167013","https://openalex.org/W1493958394","https://openalex.org/W1582340598","https://openalex.org/W2794545997","https://openalex.org/W2584980534","https://openalex.org/W2182731056","https://openalex.org/W1600949677","https://openalex.org/W2779867339"],"abstract_inverted_index":{"The":[0],"hardware":[1],"as":[2,4,121,123],"well":[3,122],"software":[5,28],"communities":[6],"have":[7],"recently":[8],"experienced":[9],"a":[10,76,100,133,152,158],"shift":[11],"towards":[12],"mitigating":[13,22],"bit":[14,51,85],"flips":[15,86],"issues":[16],"in":[17,24,56,87,151,165],"software,":[18],"rather":[19],"than":[20],"completely":[21],"only":[23],"hardware.":[25],"For":[26],"this":[27,61,163,166],"error":[29,32],"mitigation,":[30],"arithmetic":[31,42],"coding":[33,37],"schemes":[34],"like":[35],"AN":[36],"are":[38],"increasingly":[39],"applied":[40],"because":[41],"operations":[43],"can":[44,108],"be":[45,96,109],"directly":[46],"executed":[47],"without":[48],"decoding":[49],"and":[50],"flip":[52],"detection":[53],"is":[54,67,146],"provided":[55],"an":[57],"end-to-end":[58],"fashion.":[59],"In":[60],"case,":[62],"each":[63,88],"encoded":[64],"data":[65,73,118],"word":[66,74,119],"computed":[68],"by":[69],"multiplying":[70],"the":[71,91,112,117,125,142],"original":[72],"with":[75],"constant":[77],"integer":[78],"value":[79,92,113,143],"A.":[80],"To":[81,148],"reliably":[82],"detect":[83],"b":[84,105],"code":[89],"word,":[90],"A":[93,114,145],"has":[94],"to":[95,131],"well-chosen,":[97],"so":[98],"that":[99,150],"minimum":[101,127],"Hamming":[102,128],"distance":[103],"of":[104,141],"+":[106],"1":[107],"guaranteed.":[110],"However,":[111],"depends":[115],"on":[116,124],"length":[120],"desired":[126],"distance.":[129],"Up":[130],"now,":[132],"very":[134],"expensive":[135],"brute":[136],"force":[137],"approach":[138,161],"for":[139,144,162],"computation":[140],"applied.":[147],"tackle":[149],"more":[153],"efficient":[154],"way,":[155],"we":[156],"present":[157],"lower":[159],"bound-oriented":[160],"calculation":[164],"paper.":[167]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}