Trellis Decoding Technique for Array Codes
Array codes were first introduced by Elias , and have been proposed for many burst and random-error control applications [2–5]. The essence of an array code is that the combination is based on a geometrical construction, the component codes are simple and decoding of array codes is relatively easy. The simplest array code is the row-and-column parity code, which also is called a two-coordinate, bidirectional, bit and block parity and has been widely used in data transmission systems and computer memories . The code may be square or rectangular and has parameters (n1n2,k1k2,dmin), where (n1,k1) and (n2,k2) are row and column codes respectively, and minimum Hamming distance dmin=4. These codes are easy and flexible to design and relatively simple to decode. However these codes do not have the full power of block linear code of length n=n1n2, and the conventional decoding algorithms  for array codes, do not make use of maximum power of the code and are not maximum likelihood decoding algorithms.
KeywordsConvolutional Code Combine Code Array Code Channel Symbol Trellis Structure
Unable to display preview. Download preview PDF.
- 2.Farrell P.G. Array codes. - “Algebraic Coding Theory and Applications”. Ed. G.Longo, Springer-Verlag, 1979, p.p.231–242.Google Scholar
- 5.Daniel J.S., Farrell P.G. Burst-error correcting array codes: Further Development. - “4-th International Conference on Digital Processing of Signals in Communications”, Loughborough, April 1985, UK.Google Scholar
- 6.Viterbi AJ. Convolutional codes and their performance in communication systems. -“IEEE Transactions on Communications”, col.COM-19, N:5, October 1971, p.p.751–772.Google Scholar
- 7.Wolf J.K. Efficient maximum likelihood decoding of linear block codes using a trellis.-“IEEE Transactions on Information Theory”, vol. 28, No 2, 1982.Google Scholar