{"id":"https://openalex.org/W2569187438","doi":"https://doi.org/10.1142/s1793830917500173","title":"On covering radius of codes over R = \u21242 + u\u21242, where u2 = 0 using chinese euclidean distance","display_name":"On covering radius of codes over R = \u21242 + u\u21242, where u2 = 0 using chinese euclidean distance","publication_year":2017,"publication_date":"2017-01-10","ids":{"openalex":"https://openalex.org/W2569187438","doi":"https://doi.org/10.1142/s1793830917500173","mag":"2569187438"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830917500173","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830917500173","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-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/A5006736889","display_name":"P. Pandian","orcid":"https://orcid.org/0000-0003-3973-096X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"P. Chella Pandian","raw_affiliation_strings":["Department of Mathematics, Srimad Andavan Arts and Science College (Autonomous), Tiruchirappalli - 620 005, Tamilnadu, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Srimad Andavan Arts and Science College (Autonomous), Tiruchirappalli - 620 005, Tamilnadu, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006736889"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.39,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68175359,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"09","issue":"02","first_page":"1750017","last_page":"1750017"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9945999979972839,"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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.989300012588501,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/radius","display_name":"RADIUS","score":0.7315205335617065},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6448227167129517},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6260219216346741},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6029452681541443},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5508173704147339},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5196546316146851},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4711277186870575},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.46829548478126526},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.4124504327774048},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37882035970687866},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.19083696603775024},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18061813712120056}],"concepts":[{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.7315205335617065},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6448227167129517},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6260219216346741},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6029452681541443},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5508173704147339},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5196546316146851},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4711277186870575},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.46829548478126526},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.4124504327774048},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37882035970687866},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.19083696603775024},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18061813712120056},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830917500173","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830917500173","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1972421649","https://openalex.org/W2031905132","https://openalex.org/W2038681062","https://openalex.org/W2126655674","https://openalex.org/W2149814091","https://openalex.org/W2157562358","https://openalex.org/W2160500982","https://openalex.org/W2165685544","https://openalex.org/W2177092276","https://openalex.org/W4241400754"],"related_works":["https://openalex.org/W2090152127","https://openalex.org/W1965169884","https://openalex.org/W3125580510","https://openalex.org/W2008939113","https://openalex.org/W2033213447","https://openalex.org/W1566651525","https://openalex.org/W14679004","https://openalex.org/W2977652649","https://openalex.org/W2318206461","https://openalex.org/W37157938"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"give":[4,54],"lower":[5],"and":[6,31,48],"upper":[7],"bounds":[8,55],"on":[9,56],"the":[10,16,34,57],"covering":[11,35,58],"radius":[12,36,59],"of":[13,37,43,63],"codes":[14,42,62],"over":[15,66],"ring":[17],"[Formula:":[18,22,44,49,67],"see":[19,23,45,50,68],"text]":[20,24,69],"where":[21],"with":[25],"respect":[26],"to":[27],"Chinese":[28],"Euclidean":[29],"distance":[30],"also":[32],"obtain":[33],"various":[38],"Repetition":[39],"codes,":[40],"Simplex":[41],"text]-Type":[46,51],"code":[47],"code.":[52],"We":[53],"for":[60],"MacDonald":[61],"both":[64],"types":[65]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}