DocumentCode :
1739169
Title :
Weight structure of binary codes and the performance of blind search algorithms
Author :
De Assis, Francisco M.
Author_Institution :
Dept. de Engenharia Eletrica, Univ. Fed. da Paraiba, Joao Pessoa, Brazil
fYear :
2000
fDate :
2000
Firstpage :
144
Lastpage :
149
Abstract :
Algebraic block codes are vector linear subspaces defined over a finite field. The original problem of the block codes applied was that of protecting information against error during transmission over communication channels. However, combinatorial coding theory is an independent area of investigations. Algebraic codes own fertile geometric properties. Packing and covering radii are two important parameters of an algebraic code. In the author´s previous paper (1997), two inequalities relating these parameters with thoroughness and sparsity of a blind search algorithm were established. In this paper we present a closed expression for the thoroughness of a random blind search algorithm in two cases: baseline random search and random blind search guided by an algebraic code. We interpret the “worst case ” random search approach as a starting point for future research
Keywords :
algebraic codes; binary codes; block codes; genetic algorithms; search problems; algebraic block codes; baseline random search; binary codes; genetic algorithm; random blind search; thoroughness; Binary codes; Block codes; Communication channels; Error correction; Galois fields; Genetic algorithms; Hamming distance; Hamming weight; Protection; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 2000. Proceedings. Sixth Brazilian Symposium on
Conference_Location :
Rio de Janeiro, RJ
ISSN :
1522-4899
Print_ISBN :
0-7695-0856-1
Type :
conf
DOI :
10.1109/SBRN.2000.889729
Filename :
889729
Link To Document :
بازگشت