G-value Decoding of Greedy Codes
Khalil Ahmad · 2006
Error-correcting codes are widely used to increase the reliability of transmission of information over various forms of communication channels. Codes with a given minimum distance d can be constructed by a greedy algorithm [2]. In this paper, I proposed a new algorithm for the allocation of g-values to the binary vectors. Hamming (7, 4, 3) code can be generated by the application of greedy algorithm on the binary vectors of length 7 arranged in B-ordering. This code is used to demonstrate a new decoding technique for linear codes in addition to the schemes already known for decoding such as Syndrome Decoding Array (S.D.A).