{"id":"https://openalex.org/W2091876558","doi":"https://doi.org/10.1109/isit.2012.6284242","title":"A coloring approach to constructing deletion correcting codes from constant weight subgraphs","display_name":"A coloring approach to constructing deletion correcting codes from constant weight subgraphs","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2091876558","doi":"https://doi.org/10.1109/isit.2012.6284242","mag":"2091876558"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2012.6284242","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284242","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory 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/A5089243170","display_name":"Daniel Cullina","orcid":"https://orcid.org/0000-0002-7471-2102"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Cullina","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Coordinated Science Laboratory, Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","Dept. of Electrical and Computer Eng., Coordinated Science Laboratory, Dept. of Industrial and Enterprise Systems Eng., University of Illinois at Urbana-Champaign, Urbana, Illinois 61801"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Coordinated Science Laboratory, Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Electrical and Computer Eng., Coordinated Science Laboratory, Dept. of Industrial and Enterprise Systems Eng., University of Illinois at Urbana-Champaign, Urbana, Illinois 61801","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069273068","display_name":"Ankur A. Kulkarni","orcid":"https://orcid.org/0000-0001-8139-5216"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ankur A. Kulkarni","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Coordinated Science Laboratory, Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","Dept. of Electrical and Computer Eng., Coordinated Science Laboratory, Dept. of Industrial and Enterprise Systems Eng., University of Illinois at Urbana-Champaign, Urbana, Illinois 61801"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Coordinated Science Laboratory, Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Electrical and Computer Eng., Coordinated Science Laboratory, Dept. of Industrial and Enterprise Systems Eng., University of Illinois at Urbana-Champaign, Urbana, Illinois 61801","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012789968","display_name":"Negar Kiyavash","orcid":"https://orcid.org/0000-0002-8545-7709"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Negar Kiyavash","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Coordinated Science Laboratory, Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","Dept. of Electrical and Computer Eng., Coordinated Science Laboratory, Dept. of Industrial and Enterprise Systems Eng., University of Illinois at Urbana-Champaign, Urbana, Illinois 61801"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Coordinated Science Laboratory, Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Electrical and Computer Eng., Coordinated Science Laboratory, Dept. of Industrial and Enterprise Systems Eng., University of Illinois at Urbana-Champaign, Urbana, Illinois 61801","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":null,"first_page":"513","last_page":"517"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9997000098228455,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9990000128746033,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9886999726295471,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6794089078903198},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.629787266254425},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6176865100860596},{"id":"https://openalex.org/keywords/hamming","display_name":"Hamming(7,4)","score":0.5834782719612122},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.58221036195755},{"id":"https://openalex.org/keywords/hamming-graph","display_name":"Hamming graph","score":0.5646637678146362},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.541509211063385},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5302286744117737},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.5069518089294434},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.48283299803733826},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4818931221961975},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4673752188682556},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.4524487555027008},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4401141405105591},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4387401044368744},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.43551135063171387},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.41226834058761597},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3618660569190979},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2951473891735077},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2508411109447479},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23684412240982056},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.12236091494560242},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10397067666053772},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.07387837767601013}],"concepts":[{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6794089078903198},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.629787266254425},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6176865100860596},{"id":"https://openalex.org/C112932734","wikidata":"https://www.wikidata.org/wiki/Q2322550","display_name":"Hamming(7,4)","level":5,"score":0.5834782719612122},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.58221036195755},{"id":"https://openalex.org/C29696283","wikidata":"https://www.wikidata.org/wiki/Q369440","display_name":"Hamming graph","level":5,"score":0.5646637678146362},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.541509211063385},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5302286744117737},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.5069518089294434},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.48283299803733826},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4818931221961975},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4673752188682556},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.4524487555027008},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4401141405105591},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4387401044368744},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.43551135063171387},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.41226834058761597},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3618660569190979},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2951473891735077},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2508411109447479},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23684412240982056},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.12236091494560242},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10397067666053772},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.07387837767601013},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2012.6284242","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284242","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1479863711","https://openalex.org/W1647671624","https://openalex.org/W1969151232","https://openalex.org/W1974811277","https://openalex.org/W1992539276","https://openalex.org/W2035989640","https://openalex.org/W2120978458","https://openalex.org/W2509017166","https://openalex.org/W6636915900"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2105471374","https://openalex.org/W4300879987","https://openalex.org/W2786543974","https://openalex.org/W2964136540","https://openalex.org/W2364868136","https://openalex.org/W2982774419","https://openalex.org/W2740543340","https://openalex.org/W2106912783","https://openalex.org/W1519122282"],"abstract_inverted_index":{"We":[0,30,50,87,96],"take":[1],"a":[2,27,47,52,99],"graph":[3],"theoretic":[4],"view":[5],"of":[6,12,54,58,80,104,113],"deletion":[7,73],"correcting":[8,17],"codes.":[9],"The":[10],"problem":[11],"finding":[13,22,65],"an":[14,23,77],"n-bit":[15],"s-deletion":[16],"code":[18,92],"is":[19,93],"equivalent":[20],"to":[21],"independent":[24],"set":[25,57],"in":[26,46],"particular":[28],"graph.":[29],"discuss":[31],"the":[32,41,56,71,81,90],"relationship":[33],"between":[34],"codes":[35,43,66,105],"and":[36,38,64],"colorings":[37],"demonstrate":[39],"that":[40,89],"VT":[42],"are":[44],"optimal":[45,78],"coloring":[48,79],"sense.":[49],"describe":[51],"method":[53],"partitioning":[55],"bit":[59],"strings":[60],"by":[61],"Hamming":[62,83],"weight":[63,84],"within":[67],"each":[68],"partition.":[69],"In":[70],"single":[72],"case,":[74],"we":[75],"find":[76],"constant":[82],"induced":[85],"subgraphs.":[86],"show":[88],"resulting":[91],"asymptotically":[94],"optimal.":[95],"also":[97],"prove":[98],"lower":[100],"bound":[101],"on":[102],"size":[103],"constructed":[106],"using":[107],"these":[108],"partitions":[109],"for":[110],"any":[111],"number":[112],"deletions.":[114]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}