DocumentCode
2725538
Title
Constructing covering codes via noising
Author
Charon, I. ; Hudry, O. ; Lobstein, A.
Author_Institution
CNRS, Paris, France
fYear
1995
fDate
17-22 Sep 1995
Firstpage
242
Abstract
We show how a combinatorial optimization method, the noising method, can be used for constructing covering codes. The noising method is based on descent. Starting with an initial solution, repeat the following steps: add noise to the data (in order to change the values of the evaluation function); and apply the descent method to the current solution for the noise data. For each iteration, the amount of noise is decreased until it reaches 0 in the last iteration. The final solution is the best solution computed during the process
Keywords
codes; combinatorial mathematics; iterative methods; noise; optimisation; combinatorial optimization method; covering codes construction; descent method; evaluation function; iteration; noise data; Binary codes; Error correction codes; Operations research; Optimization methods; Random sequences; Simulated annealing; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location
Whistler, BC
Print_ISBN
0-7803-2453-6
Type
conf
DOI
10.1109/ISIT.1995.535757
Filename
535757
Link To Document