Perfect Codes and Uniformly Packed Codes

1982 ◽  
pp. 91-106
Author(s):  
J. H. van Lint
Keyword(s):  
Perfect Codes

Perfect codes in Euclidean lattices

2021 ◽  
Vol 40 (2) ◽  
Author(s):  
Giselle Strey ◽  
João E. Strapasson ◽  
Sueli I. R. Costa
Keyword(s):  
Perfect Codes ◽  
Euclidean Lattices

scholarly journals On decoding binary perfect and quasi-perfect codes over markov noise channels

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

scholarly journals Cyclotomic graphs and perfect codes

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

Perfect and Quasi-Perfect Codes Under the $l_{p}$ Metric

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

scholarly journals Complexity of Error-Correcting Code Based on Nearest Neighbor Search Algorithm

2019 ◽  
pp. 7-20
Author(s):  
Levon Arsalanyan ◽  
Hayk Danoyan
Keyword(s):  
Time Complexity ◽  
Nearest Neighbor ◽  
Search Algorithm ◽  
Error Correcting Code ◽  
Error Correcting Codes ◽  
Code Word ◽  
Nearest Neighbor Search ◽  
Perfect Codes ◽  
Neighbor Search ◽  
Weight Structures

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