{"id":"https://openalex.org/W2090969316","doi":"https://doi.org/10.1109/isit.2005.1523394","title":"A fixed-rate bit stuffing approach for high efficiency k-constrained codes","display_name":"A fixed-rate bit stuffing approach for high efficiency k-constrained codes","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2090969316","doi":"https://doi.org/10.1109/isit.2005.1523394","mag":"2090969316"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523394","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523394","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5109880568","display_name":"Yogesh Sankarasubramaniam","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Y. Sankarasubramaniam","raw_affiliation_strings":["School of Electrical & Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA","Sch. of Electr. & Comput. Eng., Georgia Inst. of Tech., Atlanta, GA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical & Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Sch. of Electr. & Comput. Eng., Georgia Inst. of Tech., Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010538525","display_name":"Stephen McLaughlin","orcid":"https://orcid.org/0000-0002-9558-8294"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S.W. McLaughlin","raw_affiliation_strings":["School of Electrical & Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA","Sch. of Electr. & Comput. Eng., Georgia Inst. of Tech., Atlanta, GA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical & Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Sch. of Electr. & Comput. Eng., Georgia Inst. of Tech., Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.2465,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51779587,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"543","last_page":"547"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991000294685364,"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.9991000294685364,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9932000041007996,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9807999730110168,"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/encoder","display_name":"Encoder","score":0.7626322507858276},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.7557245492935181},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6603691577911377},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.634676456451416},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5133582949638367},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44973790645599365},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4465675354003906},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4412795901298523},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4130343198776245},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3552969992160797},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34251031279563904},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15563899278640747},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08916303515434265}],"concepts":[{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.7626322507858276},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.7557245492935181},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6603691577911377},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.634676456451416},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5133582949638367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44973790645599365},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4465675354003906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4412795901298523},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4130343198776245},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3552969992160797},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34251031279563904},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15563899278640747},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08916303515434265},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2005.1523394","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523394","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320316896","display_name":"Seagate Technology","ror":"https://ror.org/04p1xtv71"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1579764623","https://openalex.org/W1995875735","https://openalex.org/W2002912642","https://openalex.org/W2110021477","https://openalex.org/W2133409361","https://openalex.org/W6634646948"],"related_works":["https://openalex.org/W2368824897","https://openalex.org/W1508050556","https://openalex.org/W1910862367","https://openalex.org/W1950940422","https://openalex.org/W2379365082","https://openalex.org/W2370747590","https://openalex.org/W2030109976","https://openalex.org/W2369260257","https://openalex.org/W2129146436","https://openalex.org/W2389120450"],"abstract_inverted_index":{"Binary":[0],"sequences":[1],"where":[2],"successive":[3],"ones":[4],"are":[5,13,130,137,162,180],"separated":[6],"by":[7,39,98],"at":[8],"most":[9],"k":[10,185],"consecutive":[11],"zeros,":[12],"said":[14],"to":[15,67,106,109,117,156,188],"be":[16],"k-constrained.":[17],"We":[18],"introduce":[19],"a":[20,46,55,85,119],"new":[21],"fixed-rate":[22,86],"algorithm":[23,48,129],"for":[24,54,125,139,182],"efficiently":[25],"encoding":[26,71,94,128,146,152,178],"and":[27,41,132,134,168,172],"decoding":[28],"k-constrained":[29],"sequences.":[30],"Our":[31],"approach":[32],"is":[33,45,72,96,149],"based":[34],"on":[35,175],"bit":[36,61,90,110,159],"stuffing":[37,44,62],"proposed":[38,127],"Bender":[40],"Wolf.":[42],"Bit":[43],"simple":[47],"that":[49,151],"can":[50],"produce":[51,118],"near-optimal":[52],"codes":[53],"wide":[56],"range":[57],"of":[58,88,101,184],"constraints.":[59],"While":[60],"achieves":[63],"rates":[64,153],"very":[65,154],"close":[66,155],"the":[68,89,102,126,140,157,176],"noiseless":[69],"capacity,":[70],"variable-rate,":[73],"which":[74],"severely":[75],"limits":[76],"its":[77],"practical":[78],"use.":[79],"In":[80],"this":[81],"paper,":[82],"we":[83],"present":[84],"version":[87],"stuff":[91,160],"algorithm.":[92],"High":[93],"efficiency":[95],"achieved":[97],"iterative":[99],"pre-processing":[100],"fixed-length":[103,120],"input":[104,143,167],"data":[105],"conform":[107],"it":[108],"insertion.":[111],"The":[112],"encoder":[113],"then":[114],"inserts":[115],"bits":[116],"output":[121,169],"word.":[122],"Rate":[123],"computations":[124],"discussed,":[131],"upper":[133],"lower":[135,173],"bounds":[136,174],"derived":[138],"asymptotic":[141,177],"(in":[142],"block":[144],"length)":[145],"rate.":[147],"It":[148],"seen":[150],"average":[158],"rate":[161,179],"possible":[163],"with":[164],"long,":[165],"fixed-length,":[166],"blocks.":[170],"Upper":[171],"listed":[181],"values":[183],"=":[186],"1":[187],"15":[189]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}
