{"id":"https://openalex.org/W2112261952","doi":"https://doi.org/10.1109/isit.2009.5205829","title":"Insertion rate and optimization of redundancy of constrained systems with unconstrained positions","display_name":"Insertion rate and optimization of redundancy of constrained systems with unconstrained positions","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2112261952","doi":"https://doi.org/10.1109/isit.2009.5205829","mag":"2112261952"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205829","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205829","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 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/A5041474011","display_name":"Hiroshi Kamabe","orcid":null},"institutions":[{"id":"https://openalex.org/I42405503","display_name":"Gifu University","ror":"https://ror.org/024exxj48","country_code":"JP","type":"education","lineage":["https://openalex.org/I42405503"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Hiroshi Kamabe","raw_affiliation_strings":["Department of Information Science, Gifu University, Gifu, Japan","Department of Information Science, Gifu University, 1-1, Yanagido, 501-1193, JAPAN"],"affiliations":[{"raw_affiliation_string":"Department of Information Science, Gifu University, Gifu, Japan","institution_ids":["https://openalex.org/I42405503"]},{"raw_affiliation_string":"Department of Information Science, Gifu University, 1-1, Yanagido, 501-1193, JAPAN","institution_ids":["https://openalex.org/I42405503"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041474011"],"corresponding_institution_ids":["https://openalex.org/I42405503"],"apc_list":null,"apc_paid":null,"fwci":0.3524,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.63657292,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":null,"first_page":"1559","last_page":"1563"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9990000128746033,"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.9990000128746033,"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/T11130","display_name":"Coding theory and cryptography","score":0.9909999966621399,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9850999712944031,"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/coding","display_name":"Coding (social sciences)","score":0.6940736770629883},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6097047924995422},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.6030306220054626},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.573261559009552},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5428788661956787},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5301916003227234},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.49285125732421875},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.4704876244068146},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3644251823425293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3542459011077881},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2775014638900757},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10689440369606018}],"concepts":[{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.6940736770629883},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6097047924995422},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.6030306220054626},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.573261559009552},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5428788661956787},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5301916003227234},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.49285125732421875},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.4704876244068146},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3644251823425293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3542459011077881},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2775014638900757},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10689440369606018},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2009.5205829","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205829","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.384.3911","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.384.3911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ita.calit2.net/workshop/09/files/paper/paper_123.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1974382727","https://openalex.org/W2043854093","https://openalex.org/W2098948172","https://openalex.org/W2108038060","https://openalex.org/W2169426417","https://openalex.org/W2170773451"],"related_works":["https://openalex.org/W4312628177","https://openalex.org/W2123072960","https://openalex.org/W2964219554","https://openalex.org/W2110738045","https://openalex.org/W2506713089","https://openalex.org/W2584179069","https://openalex.org/W2145379078","https://openalex.org/W2148029764","https://openalex.org/W2028674317","https://openalex.org/W2337233433"],"abstract_inverted_index":{"It":[0,76],"was":[1],"recently":[2],"shown":[3],"that":[4,79],"the":[5,22,46,66,70,80,86,90],"code":[6,35,67],"rate":[7,44,68,92],"of":[8,37,45,69],"a":[9,16,41,62],"simple":[10],"coding":[11,30,38,48,57,72],"scheme":[12,49,58,73],"is":[13,59,74,77,83,93],"better":[14,84],"than":[15,85],"previously":[17],"established":[18],"maxentropic":[19,87],"bound":[20,64,82,88],"for":[21,40,65],"Wijngaarden-Immink":[23],"reversed":[24],"modulation":[25],"and":[26,61],"error":[27],"control":[28],"scheme(W-I":[29],"scheme).":[31],"This":[32],"paper":[33],"analyzes":[34],"rates":[36],"schemes":[39],"given":[42],"insertion":[43,91],"W-I":[47,71],"using":[50],"finite":[51],"state":[52],"transition":[53],"diagrams.":[54],"A":[55],"new":[56,63,81],"proposed":[60],"derived.":[75],"proved":[78],"when":[89],"1/2.":[94]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}