Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Quasi-Perfect Codes From Cayley Graphs Over Integer Rings|
|Abstract:||The problem of searching for perfect codes has attracted great attention since the paper by Golomb and Welch, in which the existence of these codes over Lee metric spaces was considered. Since perfect codes are not very common, the problem of searching for quasi-perfect codes is also of great interest. In this aspect, also quasi-perfect Lee codes have been considered for 2-D and 3-D Lee metric spaces. In this paper, constructive methods for obtaining quasi-perfect codes over metric spaces modeled by means of Gaussian and Eisenstein-Jacobi integers are given. The obtained codes form ideals of the integer ring thus preserving the property of being geometrically uniform codes. Moreover, they are able to correct more error patterns than the perfect codes which may properly be used in asymmetric channels. Therefore, the results in this paper complement the constructions of perfect codes previously done for the same integer rings. Finally, decoding algorithms for the quasi-perfect codes obtained in this paper are provided and the relationship of the codes and the Lee metric ones is investigated.|
Eisenstein-Jacobi (EJ) integer rings
Gaussian integer rings
geometrically uniform codes
|Editor:||Ieee-inst Electrical Electronics Engineers Inc|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.