{"id":"https://openalex.org/W2170116939","doi":"https://doi.org/10.1109/isit.2004.1365199","title":"Analysis of bit-stuffing codes and lower bounds on capacity for 2-D constrained arrays using quasi-stationary measures","display_name":"Analysis of bit-stuffing codes and lower bounds on capacity for 2-D constrained arrays using quasi-stationary measures","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2170116939","doi":"https://doi.org/10.1109/isit.2004.1365199","mag":"2170116939"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365199","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365199","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5019279820","display_name":"S\u00f8ren Forchhammer","orcid":"https://orcid.org/0000-0002-6698-8870"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"S. Forchhammer","raw_affiliation_strings":["Research Center COM, Technical University of Denmark, Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Research Center COM, Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019279820"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":0.3372,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64027021,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"162","last_page":"162"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9995999932289124,"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.9995999932289124,"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/T12029","display_name":"DNA and Biological Computing","score":0.9886000156402588,"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"}},{"id":"https://openalex.org/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9685999751091003,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/constraint","display_name":"Constraint (computer-aided design)","score":0.6592142581939697},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6184327602386475},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6142118573188782},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5471592545509338},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.5432497262954712},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.525162398815155},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5201466679573059},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5102205276489258},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.43952417373657227},{"id":"https://openalex.org/keywords/capacity-planning","display_name":"Capacity planning","score":0.42713791131973267},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4206418991088867},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3713122606277466},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.20470109581947327},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.19392600655555725}],"concepts":[{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6592142581939697},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6184327602386475},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6142118573188782},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5471592545509338},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.5432497262954712},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.525162398815155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5201466679573059},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5102205276489258},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.43952417373657227},{"id":"https://openalex.org/C2781007418","wikidata":"https://www.wikidata.org/wiki/Q1456934","display_name":"Capacity planning","level":2,"score":0.42713791131973267},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4206418991088867},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3713122606277466},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.20470109581947327},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.19392600655555725},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2004.1365199","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365199","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/e14bc0b7-1298-4fca-b8ac-4de802d80bc9","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/e14bc0b7-1298-4fca-b8ac-4de802d80bc9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2157059597","https://openalex.org/W2159889939","https://openalex.org/W2176084395","https://openalex.org/W4231449865"],"related_works":["https://openalex.org/W4311883357","https://openalex.org/W94411513","https://openalex.org/W2377770720","https://openalex.org/W2113626999","https://openalex.org/W160889949","https://openalex.org/W2364696089","https://openalex.org/W2566422402","https://openalex.org/W2122756979","https://openalex.org/W3011149529","https://openalex.org/W2128841511"],"abstract_inverted_index":{"A":[0],"method":[1],"for":[2,7,56,63],"designing":[3],"quasistationary":[4],"probability":[5],"measures":[6],"two-dimensional":[8],"(2-D)":[9],"constraints":[10],"is":[11,15,70,95],"presented.":[12],"This":[13,32],"measure":[14],"derived":[16],"from":[17],"a":[18,34,81,89],"modified":[19,61],"bit-stuff":[20],"coding":[21,30],"scheme":[22],"and":[23],"it":[24],"gives":[25],"the":[26,29,39,42,60,64,77],"capacity":[27,40,55,92],"of":[28,41,59,85],"scheme.":[31],"provides":[33],"constructive":[35],"lower":[36],"bound":[37],"on":[38],"2-D":[43,65],"constraint.":[44],"The":[45,54],"main":[46],"examples":[47],"are":[48],"checkerboard":[49],"codes":[50],"with":[51,91],"binary":[52],"elements.":[53],"one":[57],"instance":[58],"bit-stuffing":[62],"runlength-limited":[66],"RLL(2,/spl":[67],"infin/)":[68],"constraint":[69,78],"calculated":[71],"to":[72],"be":[73],"0.4414":[74],"bits/symbol.":[75],"For":[76],"given":[79],"by":[80],"minimum":[82],"(1-norm)":[83],"distance":[84],"3":[86],"between":[87],"1s":[88],"code":[90],"0.3497":[93],"bits/symbol":[94],"given.":[96]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}