scholarly journals Perfect codes in some products of graphs

2021 ◽  
Vol 9 (1) ◽  
pp. 175
Author(s):  
Samane Bakaein ◽  
Mostafa Tavakoli ◽  
Freydoon Rahbarnia
Keyword(s):  
2021 ◽  
Vol 40 (2) ◽  
Author(s):  
Giselle Strey ◽  
João E. Strapasson ◽  
Sueli I. R. Costa

2009 ◽  
Vol 57 (4) ◽  
pp. 873-878 ◽  
Author(s):  
Haider Al-Lawati ◽  
Fady Alajaji
Keyword(s):  

2019 ◽  
Vol 223 (3) ◽  
pp. 931-947 ◽  
Author(s):  
Sanming Zhou
Keyword(s):  

2017 ◽  
Vol 63 (7) ◽  
pp. 4325-4331 ◽  
Author(s):  
Tao Zhang ◽  
Gennian Ge
Keyword(s):  

Author(s):  
Levon Arsalanyan ◽  
Hayk Danoyan

The Nearest Neighbor search algorithm considered in this paper is well known (Elias algorithm). It uses error-correcting codes and constructs appropriate hash-coding schemas. These schemas preprocess the data in the form of lists. Each list is contained in some sphere, centered at a code-word. The algorithm is considered for the cases of perfect codes, so the spheres and, consequently, the lists do not intersect. As such codes exist for the limited set of parameters, the algorithm is considered for some other generalizations of perfect codes, and then the same data point may be contained in different lists. A formula of time complexity of the algorithm is obtained for these cases, using coset weight structures of the mentioned codes


Sign in / Sign up

Export Citation Format

Share Document