{"id":"https://openalex.org/W2034567425","doi":"https://doi.org/10.1109/isit.2013.6620318","title":"Coding schemes for multi-level channels with unknown gain and/or offset","display_name":"Coding schemes for multi-level channels with unknown gain and/or offset","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2034567425","doi":"https://doi.org/10.1109/isit.2013.6620318","mag":"2034567425"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620318","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620318","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","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/A5020855511","display_name":"Kees A. Schouhamer Immink","orcid":"https://orcid.org/0000-0001-6747-9261"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kees A. Schouhamer Immink","raw_affiliation_strings":["Turing Machines, Inc., Rotterdam, Netherlands","Turing Machines Inc., Rotterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"Turing Machines, Inc., Rotterdam, Netherlands","institution_ids":[]},{"raw_affiliation_string":"Turing Machines Inc., Rotterdam, Netherlands","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020855511"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1096,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78843964,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"41","issue":null,"first_page":"709","last_page":"713"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","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/T12162","display_name":"Cellular Automata and Applications","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/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11130","display_name":"Coding theory and cryptography","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/codebook","display_name":"Codebook","score":0.8121298551559448},{"id":"https://openalex.org/keywords/coding-gain","display_name":"Coding gain","score":0.7339683175086975},{"id":"https://openalex.org/keywords/offset","display_name":"Offset (computer science)","score":0.7108702063560486},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5684106349945068},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.557512640953064},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5162941813468933},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.509662389755249},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.4922012388706207},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4645023047924042},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40413445234298706},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3599371910095215},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34893563389778137},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15183621644973755},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.13184598088264465}],"concepts":[{"id":"https://openalex.org/C127759330","wikidata":"https://www.wikidata.org/wiki/Q637416","display_name":"Codebook","level":2,"score":0.8121298551559448},{"id":"https://openalex.org/C76862118","wikidata":"https://www.wikidata.org/wiki/Q1105671","display_name":"Coding gain","level":3,"score":0.7339683175086975},{"id":"https://openalex.org/C175291020","wikidata":"https://www.wikidata.org/wiki/Q1156822","display_name":"Offset (computer science)","level":2,"score":0.7108702063560486},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5684106349945068},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.557512640953064},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5162941813468933},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.509662389755249},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.4922012388706207},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4645023047924042},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40413445234298706},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3599371910095215},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34893563389778137},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15183621644973755},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13184598088264465},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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":4,"locations":[{"id":"doi:10.1109/isit.2013.6620318","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620318","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1010.3166","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1010.3166","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.turing-machines.com/pdf/isit13.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.299.5911","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.5911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.exp-math.uni-essen.de/~immink/pdf/isit13.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.303.6535","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.303.6535","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.exp-math.uni-essen.de/%7Eimmink/pdf/isit13.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.8999999761581421}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W186403072","https://openalex.org/W1767546685","https://openalex.org/W2019887122","https://openalex.org/W2061919170","https://openalex.org/W2076639947","https://openalex.org/W2080824882","https://openalex.org/W2145534652","https://openalex.org/W2153648262","https://openalex.org/W2161766588","https://openalex.org/W2293169577","https://openalex.org/W2340541605","https://openalex.org/W4230546758","https://openalex.org/W6637817315"],"related_works":["https://openalex.org/W2293149949","https://openalex.org/W2026099691","https://openalex.org/W4284672201","https://openalex.org/W2377486419","https://openalex.org/W2035690879","https://openalex.org/W2068750835","https://openalex.org/W2147544396","https://openalex.org/W1992327031","https://openalex.org/W2916508064","https://openalex.org/W4241587031"],"abstract_inverted_index":{"We":[0,57],"will":[1,16,54,58],"present":[2,59],"coding":[3],"techniques":[4],"for":[5,48,63,67],"transmission":[6],"and":[7,35],"storage":[8],"channels":[9],"with":[10],"unknown":[11,42],"gain":[12,43],"and/or":[13,44],"offset.":[14,45],"It":[15],"be":[17,55],"shown":[18],"that":[19],"a":[20],"codebook":[21],"of":[22,52,71],"length-n":[23],"q-ary":[24],"codewords,":[25],"S,":[26],"where":[27],"all":[28],"codewords":[29],"in":[30],"S":[31,53],"have":[32],"equal":[33],"balance":[34],"energy":[36],"show":[37],"an":[38,60],"intrinsic":[39],"resistance":[40],"against":[41],"Generating":[46],"functions":[47],"evaluating":[49],"the":[50,64],"size":[51],"presented.":[56],"approximate":[61],"expression":[62],"code":[65],"redundancy":[66],"asymptotically":[68],"large":[69],"values":[70],"n.":[72]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}