Title

G-value decoding of Greedy Codes

Abstract/Description

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).

Location

Crystal Ball Room A, Hotel Pearl Continental, Karachi, Pakistan

Session Theme

Algorithms, Tools and Applications [ALGO-2]

Session Type

Other

Session Chair

Dr. Ashraf Iqbal

Start Date

27-8-2005 4:40 PM

End Date

27-8-2005 5:05 PM

Share

COinS
 
Aug 27th, 4:40 PM Aug 27th, 5:05 PM

G-value decoding of Greedy Codes

Crystal Ball Room A, Hotel Pearl Continental, Karachi, Pakistan

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).