{"id":"https://openalex.org/W2105897560","doi":"https://doi.org/10.1109/isit.2011.6033693","title":"On L<inf>1</inf>-distance error control codes","display_name":"On L<inf>1</inf>-distance error control codes","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2105897560","doi":"https://doi.org/10.1109/isit.2011.6033693","mag":"2105897560"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2011.6033693","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033693","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 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/A5002622368","display_name":"Luca G. Tallini","orcid":"https://orcid.org/0000-0003-4238-173X"},"institutions":[{"id":"https://openalex.org/I124326101","display_name":"University of Teramo","ror":"https://ror.org/01yetye73","country_code":"IT","type":"education","lineage":["https://openalex.org/I124326101"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luca G. Tallini","raw_affiliation_strings":["Dipartimento di Scienze della Comunicazione, Universit\u00e0 degli Studi di Teramo, Teramo, Italy","Dip. di Scienze della Comunicazione, Universit\u00e0 degli Studi di Teramo, Coste San Agostino, 64100. Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Scienze della Comunicazione, Universit\u00e0 degli Studi di Teramo, Teramo, Italy","institution_ids":["https://openalex.org/I124326101"]},{"raw_affiliation_string":"Dip. di Scienze della Comunicazione, Universit\u00e0 degli Studi di Teramo, Coste San Agostino, 64100. Italy","institution_ids":["https://openalex.org/I124326101"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108277072","display_name":"Bella Bose","orcid":null},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bella Bose","raw_affiliation_strings":["School of EECS, Oregon State University, Corvallis, OR, USA","School of EECS, Oregon State University, Corvallis, 97331, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of EECS, Oregon State University, Corvallis, OR, USA","institution_ids":["https://openalex.org/I131249849"]},{"raw_affiliation_string":"School of EECS, Oregon State University, Corvallis, 97331, USA","institution_ids":["https://openalex.org/I131249849"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6187,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.84344537,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1061","last_page":"1065"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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/T11130","display_name":"Coding theory and cryptography","score":1.0,"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/T12029","display_name":"DNA and Biological Computing","score":0.9961000084877014,"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.9955999851226807,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.8337045311927795},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.7130736708641052},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6960822343826294},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6700870990753174},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5977606177330017},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.544320285320282},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5390244722366333},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.5301265120506287},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5149122476577759},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4357570707798004},{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.43303316831588745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4226144850254059},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.38616466522216797},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.380908727645874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3172973394393921},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.22649279236793518}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.8337045311927795},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7130736708641052},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6960822343826294},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6700870990753174},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5977606177330017},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.544320285320282},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5390244722366333},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.5301265120506287},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5149122476577759},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4357570707798004},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.43303316831588745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4226144850254059},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.38616466522216797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.380908727645874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3172973394393921},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.22649279236793518},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"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":2,"locations":[{"id":"doi:10.1109/isit.2011.6033693","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033693","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},{"id":"pmh:oai:research.unite.it:11575/9036","is_oa":false,"landing_page_url":"http://hdl.handle.net/11575/9036","pdf_url":null,"source":{"id":"https://openalex.org/S4306401171","display_name":"UniTERAMO Research Catalog (University of Teramo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124326101","host_organization_name":"University of Teramo","host_organization_lineage":["https://openalex.org/I124326101"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1594652978","https://openalex.org/W2086644100","https://openalex.org/W2096337439","https://openalex.org/W2147555059","https://openalex.org/W6910292315"],"related_works":["https://openalex.org/W2173495775","https://openalex.org/W2184059163","https://openalex.org/W2048794010","https://openalex.org/W2762830775","https://openalex.org/W2115572740","https://openalex.org/W2141158404","https://openalex.org/W3011923935","https://openalex.org/W3103409964","https://openalex.org/W2105897560","https://openalex.org/W3100027604"],"abstract_inverted_index":{"This":[0],"paper":[1],"gives":[2],"some":[3,39],"theory":[4],"and":[5,43,55,64,79,85,107],"design":[6],"of":[7,11,36,53,71,87],"efficient":[8,45],"codes":[9,103],"capable":[10,70],"controlling":[12,72],"(i.":[13],"e.,":[14],"correcting/detecting/correcting":[15],"erasure)":[16],"errors":[17],"measured":[18],"under":[19],"the":[20,33,44,83,101],"L1distance":[21],"defined":[22],"over":[23,91],"m-ary":[24,57],"words,":[25],"2":[26],"\u2264":[27,29,74],"m":[28,59],"+\u221e.":[30],"We":[31],"give":[32,50],"combinatorial":[34],"characterizations":[35],"such":[37],"codes,":[38,58],"general":[40],"code":[41,90],"designs":[42],"decoding":[46],"algorithms.":[47],"Then,":[48],"we":[49],"a":[51,66,88],"class":[52],"linear":[54],"systematic":[56],"=":[60,109],"sp":[61],"with":[62,93],"s\u2208IN":[63],"p":[65],"prime,":[67],"which":[68],"are":[69,81],"d":[73,97],"p-1":[75],"errors.":[76],"If":[77],"n":[78,106],"k\u2208IN":[80],"respectively":[82],"length":[84,105],"dimension":[86],"BCH":[89],"GF(p)":[92],"minimum":[94],"Hamming":[95],"distance":[96],"+":[98,111],"1":[99],"then":[100],"new":[102],"have":[104],"k'":[108],"k":[110],"r":[112],"logms":[113],"information":[114],"digits.":[115]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}