{"id":"https://openalex.org/W2073475704","doi":"https://doi.org/10.1109/isit.2014.6875069","title":"Constructions for constant-weight ICI-free codes","display_name":"Constructions for constant-weight ICI-free codes","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2073475704","doi":"https://doi.org/10.1109/isit.2014.6875069","mag":"2073475704"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6875069","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875069","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 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/A5012789294","display_name":"Scott Kayser","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Scott Kayser","raw_affiliation_strings":["University of California - San Diego, La Jolla, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California - San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060049531","display_name":"Paul H. Siegel","orcid":"https://orcid.org/0000-0001-5850-0874"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul H. Siegel","raw_affiliation_strings":["University of California - San Diego, La Jolla, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California - San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012789294"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":3.5608,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.930753,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1431","last_page":"1435"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9998999834060669,"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.9998999834060669,"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.9995999932289124,"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/T11130","display_name":"Coding theory and cryptography","score":0.9994000196456909,"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/constraint","display_name":"Constraint (computer-aided design)","score":0.6698364019393921},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5524746179580688},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5486153960227966},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5419723391532898},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.541344165802002},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5374292731285095},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.5052531361579895},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.48792311549186707},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.4673464894294739},{"id":"https://openalex.org/keywords/interference","display_name":"Interference (communication)","score":0.4355486333370209},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.4348964989185333},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3708784580230713},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34888190031051636},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33294743299484253},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3009859025478363},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.11243125796318054},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.07242381572723389}],"concepts":[{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6698364019393921},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5524746179580688},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5486153960227966},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5419723391532898},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.541344165802002},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5374292731285095},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.5052531361579895},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.48792311549186707},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.4673464894294739},{"id":"https://openalex.org/C32022120","wikidata":"https://www.wikidata.org/wiki/Q797225","display_name":"Interference (communication)","level":3,"score":0.4355486333370209},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.4348964989185333},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3708784580230713},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34888190031051636},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33294743299484253},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3009859025478363},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.11243125796318054},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.07242381572723389},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2014.6875069","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875069","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1995875735","https://openalex.org/W2002129922","https://openalex.org/W2041588219","https://openalex.org/W2112994980","https://openalex.org/W2125636047","https://openalex.org/W2135288278","https://openalex.org/W2155622784","https://openalex.org/W2167140549"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2105471374","https://openalex.org/W2963549154","https://openalex.org/W2158117886","https://openalex.org/W1987803429","https://openalex.org/W1582340598","https://openalex.org/W1519122282","https://openalex.org/W1530654122","https://openalex.org/W2182731056","https://openalex.org/W2176368139"],"abstract_inverted_index":{"In":[0],"this":[1,81],"paper,":[2],"we":[3],"consider":[4],"the":[5,11,20,35,39,45,51],"joint":[6],"coding":[7],"constraint":[8,37,47],"of":[9,41,58,74],"forbidding":[10],"101":[12],"subsequence":[13],"and":[14],"requiring":[15],"all":[16],"codewords":[17],"to":[18,30,49],"have":[19],"same":[21],"Hamming":[22],"weight.":[23],"These":[24],"two":[25],"constraints":[26],"are":[27],"particularly":[28],"applicable":[29],"SLC":[31],"flash":[32],"memory":[33],"-":[34],"first":[36],"mitigates":[38],"problem":[40],"inter-cell":[42],"interference,":[43],"while":[44],"second":[46],"helps":[48],"alleviate":[50],"problems":[52],"that":[53,67,77],"arise":[54],"from":[55,80],"voltage":[56],"drift":[57],"programmed":[59],"cells.":[60],"We":[61],"give":[62],"a":[63],"construction":[64],"for":[65],"codes":[66,76],"satisfy":[68],"both":[69],"constraints,":[70],"then":[71],"analyze":[72],"properties":[73],"best-case":[75],"can":[78],"come":[79],"construction.":[82]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}