ABSTRACT
ABSTRACT: In digital transmission and storage systems, Error-Control Codes (ECC) provide a security mechanism allowing the detection and correction of a certain amount of errors, which can be caused by the presence of noise in these systems. ECC are denoted as [n, k, dmin], where “n” denotes the codeword length, “k” number of information symbols and “dmin” is the minimum code distance. The minimum code distance determines the error correction/detection capabilities of a given code. Theoretically computed bounds of minimum code distance for many ECC have been found but to find generator matrices for many codes reaching theoretical bounds still remains a research problem. The presented paper describes an improved version of a proposed algorithm used for searching for the generator matrices of binary ECC. The described algorithm is based on an alteration of generator matrices of already found ECC. The presented algorithm reduces the total amount of tests required by the basic algorithm in order to reduce the execution time of the whole search process. The final part of this paper compares the execution time and memory requirements of the basic and improved version of the search algorithm.
