{"id":"https://openalex.org/W2146881262","doi":"https://doi.org/10.1109/eit.2009.5189577","title":"Joint source-channel coding using finite state integer arithmetic codes","display_name":"Joint source-channel coding using finite state integer arithmetic codes","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2146881262","doi":"https://doi.org/10.1109/eit.2009.5189577","mag":"2146881262"},"language":"en","primary_location":{"id":"doi:10.1109/eit.2009.5189577","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eit.2009.5189577","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Electro/Information Technology","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/A5067312762","display_name":"Hashem Moradmand","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hashem Moradmand","raw_affiliation_strings":["Electrical and Electronic Engineering Center, MUT, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Electrical and Electronic Engineering Center, MUT, Tehran, Iran","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088425410","display_name":"Ali Payandeh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ali Payandeh","raw_affiliation_strings":["Electrical and Electronic Engineering Center, MUT, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Electrical and Electronic Engineering Center, MUT, Tehran, Iran","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028840314","display_name":"Mohammad Reza Aref","orcid":"https://orcid.org/0000-0002-4321-0345"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohammad Reza Aref","raw_affiliation_strings":["Sharif University of Technology, Tehran, Iran","Sharif University of Technology , Tehran , Iran"],"affiliations":[{"raw_affiliation_string":"Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]},{"raw_affiliation_string":"Sharif University of Technology , Tehran , Iran","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067312762"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7447,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.87774744,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"13","issue":null,"first_page":"19","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9991000294685364,"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/T12029","display_name":"DNA and Biological Computing","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/viterbi-decoder","display_name":"Viterbi decoder","score":0.7893908023834229},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.7408238053321838},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6811789870262146},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.604430615901947},{"id":"https://openalex.org/keywords/cyclic-redundancy-check","display_name":"Cyclic redundancy check","score":0.5948953628540039},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5782672166824341},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5582032799720764},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5497881770133972},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4782915711402893},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.4669225215911865},{"id":"https://openalex.org/keywords/arithmetic-coding","display_name":"Arithmetic coding","score":0.4544130563735962},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.43547362089157104},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4298434853553772},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.42891350388526917},{"id":"https://openalex.org/keywords/forward-error-correction","display_name":"Forward error correction","score":0.42652827501296997},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.411998450756073},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4103904962539673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2308146357536316},{"id":"https://openalex.org/keywords/context-adaptive-binary-arithmetic-coding","display_name":"Context-adaptive binary arithmetic coding","score":0.15312138199806213},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.06602376699447632}],"concepts":[{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.7893908023834229},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.7408238053321838},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6811789870262146},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.604430615901947},{"id":"https://openalex.org/C137627569","wikidata":"https://www.wikidata.org/wiki/Q245471","display_name":"Cyclic redundancy check","level":3,"score":0.5948953628540039},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5782672166824341},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5582032799720764},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5497881770133972},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4782915711402893},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.4669225215911865},{"id":"https://openalex.org/C153338461","wikidata":"https://www.wikidata.org/wiki/Q2651","display_name":"Arithmetic coding","level":4,"score":0.4544130563735962},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.43547362089157104},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4298434853553772},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.42891350388526917},{"id":"https://openalex.org/C202932441","wikidata":"https://www.wikidata.org/wiki/Q55611017","display_name":"Forward error correction","level":3,"score":0.42652827501296997},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.411998450756073},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4103904962539673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2308146357536316},{"id":"https://openalex.org/C175732694","wikidata":"https://www.wikidata.org/wiki/Q1128713","display_name":"Context-adaptive binary arithmetic coding","level":3,"score":0.15312138199806213},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.06602376699447632},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/eit.2009.5189577","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eit.2009.5189577","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Electro/Information Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1847634394","https://openalex.org/W1995875735","https://openalex.org/W2010355980","https://openalex.org/W2122412208","https://openalex.org/W2135083501","https://openalex.org/W2136676929","https://openalex.org/W2149072083","https://openalex.org/W2151850815","https://openalex.org/W2503171161"],"related_works":["https://openalex.org/W2102309991","https://openalex.org/W1795315578","https://openalex.org/W2373954783","https://openalex.org/W2133857928","https://openalex.org/W2143297499","https://openalex.org/W2535886977","https://openalex.org/W2356694334","https://openalex.org/W2991144886","https://openalex.org/W2790444905","https://openalex.org/W1843778016"],"abstract_inverted_index":{"Inserting":[0],"redundancy":[1,62],"to":[2,9,14],"arithmetic":[3,49],"codes":[4,50],"is":[5,27],"a":[6,40,53,60,66],"common":[7],"strategy":[8,24],"add":[10],"error":[11,25],"detection":[12],"capability":[13],"this":[15,23,38],"well-known":[16],"family":[17],"of":[18],"source":[19],"codes.":[20],"By":[21],"using":[22],"correction":[26],"possible":[28],"through":[29],"some":[30],"decoding":[31],"algorithms":[32],"such":[33],"as":[34,52],"Viterbi":[35,68],"decoder.":[36,69],"In":[37],"paper":[39],"system":[41],"has":[42,73],"proposed":[43,71],"that":[44],"uses":[45],"finite":[46],"state":[47],"integer":[48],"(FSAC)":[51],"joint":[54],"source-channel":[55],"code":[56],"in":[57],"combination":[58],"with":[59],"cyclic":[61],"check":[63],"(CRC)":[64],"and":[65],"List":[67],"The":[70],"scheme":[72],"shown":[74],"better":[75],"performance":[76],"than":[77],"previous":[78],"ones.":[79]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}