{"id":"https://openalex.org/W1990283733","doi":"https://doi.org/10.1109/isit.2013.6620206","title":"Hamming-weight constrained coded arrays based on covering codes","display_name":"Hamming-weight constrained coded arrays based on covering codes","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W1990283733","doi":"https://doi.org/10.1109/isit.2013.6620206","mag":"1990283733"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620206","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620206","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 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/A5006239162","display_name":"Erik Ordentlich","orcid":null},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Erik Ordentlich","raw_affiliation_strings":["Hewlett Packard Laboratories, Palo Alto, CA, USA","Hewlett\u2013Packard Laboratories, Palo Alto, CA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hewlett Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]},{"raw_affiliation_string":"Hewlett\u2013Packard Laboratories, Palo Alto, CA, USA#TAB#","institution_ids":["https://openalex.org/I1324840837"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074098103","display_name":"Ron M. Roth","orcid":"https://orcid.org/0000-0003-4168-9505"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ron M. Roth","raw_affiliation_strings":["Computer Science Department, Technion, Haifa, Israel","Computer Sci. Dept., Technion - Israel Inst. of Tech., Haifa, Israel#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Computer Sci. Dept., Technion - Israel Inst. of Tech., Haifa, Israel#TAB#","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.05934265,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"58","issue":null,"first_page":"151","last_page":"155"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","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/T12162","display_name":"Cellular Automata and Applications","score":0.9987999796867371,"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/T10502","display_name":"Advanced Memory and Neural Computing","score":0.996999979019165,"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/hamming-weight","display_name":"Hamming weight","score":0.6590559482574463},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6441223621368408},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6072824597358704},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5668795108795166},{"id":"https://openalex.org/keywords/hamming","display_name":"Hamming(7,4)","score":0.5614237785339355},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5570695996284485},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.5185616612434387},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5132415294647217},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.487341970205307},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4806743562221527},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4719012379646301},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43849682807922363},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.42924946546554565},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3599094748497009},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3456984758377075},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3433460593223572},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3067123591899872},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.2545163929462433},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.16980856657028198},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10720387101173401}],"concepts":[{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.6590559482574463},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6441223621368408},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6072824597358704},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5668795108795166},{"id":"https://openalex.org/C112932734","wikidata":"https://www.wikidata.org/wiki/Q2322550","display_name":"Hamming(7,4)","level":5,"score":0.5614237785339355},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5570695996284485},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.5185616612434387},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5132415294647217},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.487341970205307},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4806743562221527},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4719012379646301},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43849682807922363},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.42924946546554565},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3599094748497009},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3456984758377075},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3433460593223572},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3067123591899872},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2545163929462433},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.16980856657028198},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10720387101173401},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2013.6620206","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620206","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 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":6,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W1973807195","https://openalex.org/W2031176269","https://openalex.org/W2111550877","https://openalex.org/W2127404904","https://openalex.org/W2129734332"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2105471374","https://openalex.org/W1987803429","https://openalex.org/W2963549154","https://openalex.org/W2158117886","https://openalex.org/W2740543340","https://openalex.org/W1519122282","https://openalex.org/W1582340598","https://openalex.org/W2182731056","https://openalex.org/W2022910297"],"abstract_inverted_index":{"We":[0,41],"present":[1],"a":[2,24,101,111],"framework":[3,60,90],"based":[4,104],"on":[5,28,105],"covering":[6,73],"codes":[7],"over":[8],"the":[9,29,47,50,71,76,81,85,88,98],"set":[10],"of":[11,34,58,100],"binary":[12,21],"n-words":[13],"for":[14,46,84],"coding":[15],"data":[16],"into":[17],"n":[18,20],"\u00d7":[19],"arrays":[22],"with":[23],"prescribed":[25],"upper":[26,51],"bound":[27,52],"Hamming":[30],"weight":[31],"(i.e.,":[32],"number":[33],"1's)":[35],"in":[36,96,110],"each":[37],"row":[38],"and":[39,61,91],"column.":[40],"obtain":[42],"previously":[43],"presented":[44],"schemes":[45,83,92],"case":[48],"when":[49,70],"is":[53,75],"n/2":[54,86],"as":[55],"special":[56],"cases":[57],"this":[59],"we":[62],"study":[63],"also":[64],"another":[65],"potentially":[66],"practically":[67],"relevant":[68],"specialization":[69],"underlying":[72],"code":[74],"first-order":[77],"Reed-Muller":[78],"code.":[79],"Like":[80],"previous":[82],"case,":[87],"proposed":[89],"may":[93],"have":[94],"applications":[95],"improving":[97],"performance":[99],"next-generation":[102],"memory":[103],"programmable":[106],"resistive":[107],"devices":[108],"arranged":[109],"crossbar":[112],"architecture.":[113]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}