{"id":"https://openalex.org/W2126844143","doi":"https://doi.org/10.1109/tit.1973.1054934","title":"A 2-cycle algorithm for source coding with a fidelity criterion","display_name":"A 2-cycle algorithm for source coding with a fidelity criterion","publication_year":1973,"publication_date":"1973-01-01","ids":{"openalex":"https://openalex.org/W2126844143","doi":"https://doi.org/10.1109/tit.1973.1054934","mag":"2126844143"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1973.1054934","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1973.1054934","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/A5104607874","display_name":"J. Anderson","orcid":"https://orcid.org/0000-0002-6625-114X"},"institutions":[{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"J. Anderson","raw_affiliation_strings":["Department of Electrical Engineering, McMaster University, Hamilton, ONT, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, McMaster University, Hamilton, ONT, Canada","institution_ids":["https://openalex.org/I98251732"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109975749","display_name":"F. Jelinek","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"F. Jelinek","raw_affiliation_strings":["School of Electrical Engineering, Cornell University, Ithaca, NY, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5104607874"],"corresponding_institution_ids":["https://openalex.org/I98251732"],"apc_list":null,"apc_paid":null,"fwci":14.2066,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.98542502,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"19","issue":"1","first_page":"77","last_page":"92"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9855999946594238,"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.9855999946594238,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.98089998960495,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9506999850273132,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6594343185424805},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5978346467018127},{"id":"https://openalex.org/keywords/rate\u2013distortion-theory","display_name":"Rate\u2013distortion theory","score":0.5925247669219971},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.4989326000213623},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.49124282598495483},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.4818105101585388},{"id":"https://openalex.org/keywords/distortion-function","display_name":"Distortion function","score":0.48163241147994995},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4396897852420807},{"id":"https://openalex.org/keywords/fidelity","display_name":"Fidelity","score":0.436969518661499},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.43276113271713257},{"id":"https://openalex.org/keywords/distortion","display_name":"Distortion (music)","score":0.4203934669494629},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.4156820476055145},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3350072205066681},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2936058044433594},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2161286473274231},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1701509654521942},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.13134819269180298}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6594343185424805},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5978346467018127},{"id":"https://openalex.org/C64185310","wikidata":"https://www.wikidata.org/wiki/Q843483","display_name":"Rate\u2013distortion theory","level":3,"score":0.5925247669219971},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.4989326000213623},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.49124282598495483},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.4818105101585388},{"id":"https://openalex.org/C2780803321","wikidata":"https://www.wikidata.org/wiki/Q5283073","display_name":"Distortion function","level":3,"score":0.48163241147994995},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4396897852420807},{"id":"https://openalex.org/C2776459999","wikidata":"https://www.wikidata.org/wiki/Q2119376","display_name":"Fidelity","level":2,"score":0.436969518661499},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.43276113271713257},{"id":"https://openalex.org/C126780896","wikidata":"https://www.wikidata.org/wiki/Q899871","display_name":"Distortion (music)","level":4,"score":0.4203934669494629},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.4156820476055145},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3350072205066681},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2936058044433594},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2161286473274231},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1701509654521942},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.13134819269180298},{"id":"https://openalex.org/C194257627","wikidata":"https://www.wikidata.org/wiki/Q211554","display_name":"Amplifier","level":3,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.0},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1973.1054934","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1973.1054934","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2021436622","https://openalex.org/W2035227369","https://openalex.org/W2099839668","https://openalex.org/W2154899385","https://openalex.org/W2170545357","https://openalex.org/W2219576505","https://openalex.org/W4301441647","https://openalex.org/W4392750738"],"related_works":["https://openalex.org/W1540819826","https://openalex.org/W2364472724","https://openalex.org/W2964219554","https://openalex.org/W2289165157","https://openalex.org/W1413489299","https://openalex.org/W2964332837","https://openalex.org/W4289655361","https://openalex.org/W2506713089","https://openalex.org/W4298174712","https://openalex.org/W1728408604"],"abstract_inverted_index":{"Since":[0],"the":[1,7,16,26,56,67,72,95,131,139,150,162,182,195,210],"birth":[2],"of":[3,10,18,28,76,83,99,155,161,169],"rate-distortion":[4,29,48,106,144],"theory":[5,20,188],"with":[6,60,85,192],"landmark":[8],"paper":[9,51,183],"Shannon,":[11],"research":[12],"has":[13,33],"centered":[14],"on":[15,25,122],"extension":[17],"his":[19],"to":[21,93,114,177,194,208],"new":[22],"situations":[23],"and":[24,117,125,130,171,173,189,199],"calculation":[27],"functions.":[30],"Comparatively":[31],"little":[32],"been":[34],"done":[35],"toward":[36],"developing":[37],"efficient":[38],"algorithms":[39],"for":[40,80],"encoding":[41,126],"information":[42],"sources":[43,84],"at":[44],"rates":[45],"near":[46],"Shannon's":[47,143],"limit.":[49],"This":[50],"reports":[52],"one":[53],"such":[54],"algorithm,":[55,58,69],"2-cycle":[57,68],"used":[59],"randomly":[61],"chosen":[62],"tree":[63,81],"codes.":[64],"In":[65],"analyzing":[66],"we":[70],"present":[71],"first":[73,96],"theoretical":[74],"analysis":[75],"a":[77,86],"realizable":[78],"algorithm":[79,90,163,211],"coding":[82,100,140],"fidelity":[87],"criterion.":[88],"The":[89,158],"may":[91],"prove":[92],"be":[94],"practical":[97],"method":[98],"whose":[101],"design":[102],"actually":[103],"derives":[104],"from":[105],"theory.":[107],"Analysis":[108],"proceeds":[109],"by":[110,187,190],"bounding":[111],"methods":[112],"related":[113],"difference":[115],"equations":[116],"branching":[118,152],"processes.":[119],"Upper":[120],"bounds":[121],"average":[123],"distortion":[124,201],"work":[127],"are":[128,133,164,175,206],"obtained":[129],"latter":[132],"shown":[134],"bounded":[135],"as":[136,138],"long":[137],"rate":[141],"exceeds":[142],"function.":[145],"Of":[146],"particular":[147],"interest":[148],"is":[149,184],"stack-searched":[151],"process":[153],"bound":[154],"Section":[156],"IV.":[157],"two":[159],"cycles":[160],"described":[165],"fully":[166],"in":[167],"terms":[168],"expectations":[170],"probabilities,":[172],"recursions":[174],"listed":[176],"compute":[178],"these":[179],"quantities.":[180],"Concluding":[181],"numerical":[185,204],"analysis,":[186],"simulation,":[191],"respect":[193],"binary":[196],"i.i.d,":[197],"source":[198],"Hamming":[200],"measure.":[202],"These":[203],"results":[205],"sufficient":[207],"optimize":[209],"over":[212],"its":[213],"free":[214],"parameters.":[215]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}