{"id":"https://openalex.org/W2162947563","doi":"https://doi.org/10.1109/isit.1997.613356","title":"Joint source-channel coding with variable length codes","display_name":"Joint source-channel coding with variable length codes","publication_year":2002,"publication_date":"2002-11-22","ids":{"openalex":"https://openalex.org/W2162947563","doi":"https://doi.org/10.1109/isit.1997.613356","mag":"2162947563"},"language":"en","primary_location":{"id":"doi:10.1109/isit.1997.613356","doi":"https://doi.org/10.1109/isit.1997.613356","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.1997.613356","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"Proceedings of IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5018991038","display_name":"Vladimir B. Balakirsky","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"V.B. Balakirsky","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Mathematik, Universit\u00e4t Bielefeld, Bielefeld, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik, Universit\u00e4t Bielefeld, Bielefeld, Germany","institution_ids":["https://openalex.org/I20121455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018991038"],"corresponding_institution_ids":["https://openalex.org/I20121455"],"apc_list":null,"apc_paid":null,"fwci":5.2307,"has_fulltext":false,"cited_by_count":98,"citation_normalized_percentile":{"value":0.96536145,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"419","last_page":"419"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9922000169754028,"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"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9922000169754028,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.003599999938160181,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.002099999925121665,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/joint-source-channel-coding","display_name":"joint source-channel coding","score":0.9990000128746033},{"id":"https://openalex.org/keywords/variable-length-coding","display_name":"variable-length codes","score":0.9929999709129333},{"id":"https://openalex.org/keywords/convolutional-decoding","display_name":"convolutional decoding","score":0.7670000195503235},{"id":"https://openalex.org/keywords/discrete-memoryless-channels","display_name":"discrete memoryless channels","score":0.7210000157356262},{"id":"https://openalex.org/keywords/maximum-likelihood-decoding","display_name":"maximum likelihood decoding","score":0.7059999704360962},{"id":"https://openalex.org/keywords/decoding-delay","display_name":"decoding latency","score":0.6420000195503235},{"id":"https://openalex.org/keywords/noisy-channel-transmission","display_name":"noisy channel transmission","score":0.6060000061988831}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7493909001350403},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.7112196087837219},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6998050212860107},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6454923152923584},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.6389631032943726},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5925650596618652},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.5572009086608887},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5249348282814026},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5040234923362732},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.48203906416893005},{"id":"https://openalex.org/C194405637","wikidata":"https://www.wikidata.org/wiki/Q369367","display_name":"Repetition code","level":5,"score":0.48052582144737244},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4623594880104065},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.4464068114757538},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.34629106521606445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24907177686691284},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1669362485408783},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10652950406074524},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09869030117988586},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.1997.613356","doi":"https://doi.org/10.1109/isit.1997.613356","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.1997.613356","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"Proceedings of IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.33.7497","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.7497","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mathematik.uni-bielefeld.de/ahlswede/pub/balakirsky/vb_var.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W1572157493"],"related_works":["https://openalex.org/W1594802032","https://openalex.org/W2041126849","https://openalex.org/W2160349402","https://openalex.org/W7038689504","https://openalex.org/W2130845604","https://openalex.org/W2055178310","https://openalex.org/W7098825726","https://openalex.org/W2112300012","https://openalex.org/W2124330795","https://openalex.org/W2000595727"],"abstract_inverted_index":{"We":[0,88],"consider":[1],"an":[2],"information":[3],"transmission":[4,59],"scheme":[5,78],"where":[6],"a":[7,14,24,31,39,90,120],"stream":[8,40,127],"of":[9,26,41,43,54,83,100,124,128],"messages":[10],"is":[11,28,68,105,114],"encoded":[12],"using":[13],"variable":[15,55],"length":[16,56,99],"code,":[17],"and":[18,110,116],"the":[19,44,48,52,66,81,97,101,108,117,125],"code":[20,67,103],"sequence,":[21],"obtained":[22],"as":[23],"concatenation":[25],"codewords,":[27],"transmitted":[29,102],"over":[30,60],"noisy":[32,61],"discrete":[33],"memoryless":[34],"channel.":[35],"The":[36],"decoder":[37,109,118],"constructs":[38,119],"estimates":[42],"messages.":[45,129],"Note":[46],"that":[47,50],"problems":[49],"concern":[51],"use":[53],"codes":[57],"for":[58,71],"channels":[62],"also":[63],"appear":[64],"if":[65],"used":[69],"only":[70],"source":[72],"encoding":[73],"since":[74],"any":[75],"channel":[76],"coding":[77],"cannot":[79],"reduce":[80],"level":[82],"noise":[84],"up":[85],"to":[86,107],"zero.":[87],"propose":[89],"convolutional-type":[91],"decoding":[92,112],"algorithm":[93],"assuming":[94],"that:":[95],"(1)":[96],"total":[98],"sequence":[104],"known":[106],"(2)":[111],"delay":[113],"allowed":[115],"maximum":[121],"likelihood":[122],"estimate":[123],"whole":[126]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}