{"id":"https://openalex.org/W2131102741","doi":"https://doi.org/10.1109/isit.2004.1365125","title":"A convolution interpretation of (M, d, k) run-length-limited capacity","display_name":"A convolution interpretation of (M, d, k) run-length-limited capacity","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2131102741","doi":"https://doi.org/10.1109/isit.2004.1365125","mag":"2131102741"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365125","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365125","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":"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":["Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA","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","School of Electrical & Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical & Computer Engineering, Georgia Institute of Technology, Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"School of Electrical & Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA","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.7179,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.72196871,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"88","last_page":"88"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9467999935150146,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9467999935150146,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/interpretation","display_name":"Interpretation (philosophy)","score":0.7433145046234131},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6755848526954651},{"id":"https://openalex.org/keywords/convolution","display_name":"Convolution (computer science)","score":0.6459375619888306},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.618420422077179},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5878596901893616},{"id":"https://openalex.org/keywords/equivalence-class","display_name":"Equivalence class (music)","score":0.4940848648548126},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4562254548072815},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4359031915664673},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32238703966140747},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30640077590942383},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2847020626068115},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0965530276298523},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09411531686782837}],"concepts":[{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.7433145046234131},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6755848526954651},{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.6459375619888306},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.618420422077179},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5878596901893616},{"id":"https://openalex.org/C2777044963","wikidata":"https://www.wikidata.org/wiki/Q5384707","display_name":"Equivalence class (music)","level":2,"score":0.4940848648548126},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4562254548072815},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4359031915664673},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32238703966140747},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30640077590942383},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2847020626068115},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0965530276298523},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09411531686782837},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2004.1365125","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365125","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2003416288","https://openalex.org/W2129358847"],"related_works":["https://openalex.org/W2382232876","https://openalex.org/W2996538923","https://openalex.org/W2182642161","https://openalex.org/W4255196547","https://openalex.org/W2358659170","https://openalex.org/W146502352","https://openalex.org/W2055587080","https://openalex.org/W2379751811","https://openalex.org/W2034764251","https://openalex.org/W1995824109"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"the":[3,26,39,64,73],"problem":[4],"of":[5,12],"capacity":[6],"equivalence":[7,67],"for":[8,19],"a":[9,34],"general":[10],"class":[11],"(M,d,k)":[13,21,41],"run-length-limited":[14],"constraints,":[15],"namely":[16],"we":[17,61],"look":[18],"pairs":[20],"and":[22,49,69],"(M',d',k')":[23],"that":[24],"have":[25],"same":[27],"capacity.":[28],"Our":[29],"approach":[30],"is":[31,43,51],"based":[32],"on":[33],"time":[35],"domain":[36],"interpretation":[37],"where":[38],"characteristic":[40],"polynomial":[42],"viewed":[44],"as":[45],"an":[46],"impulse":[47],"train":[48],"factorization":[50],"related":[52],"to":[53,72],"convolution":[54],"in":[55],"discrete":[56],"time.":[57],"Using":[58],"this":[59],"interpretation,":[60],"first":[62],"derive":[63],"known":[65],"binary":[66],"relations":[68],"then":[70],"generalize":[71],"M-ary":[74],"case.":[75]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}