Eurocode ’92 pp 339-349 | Cite as

Trellis Decoding Technique for Array Codes

  • B. Honary
  • G. S. Markarian
  • L. Kaya
  • M. Darnell
Part of the International Centre for Mechanical Sciences book series (CISM, volume 339)


Array codes were first introduced by Elias [1], 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 [2]. 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 [2] for array codes, do not make use of maximum power of the code and are not maximum likelihood decoding algorithms.


Convolutional Code Combine Code Array Code Channel Symbol Trellis Structure 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Elias P. Error free coding. -“IEEE Transactions”, vol. 4, 1954, p.p.29–37.MathSciNetGoogle Scholar
  2. 2.
    Farrell P.G. Array codes. - “Algebraic Coding Theory and Applications”. Ed. G.Longo, Springer-Verlag, 1979, p.p.231–242.Google Scholar
  3. 3.
    Burton H.O., Weldon EJ. Cyclic product codes. - “IEEE Transactions on Information Theory”, vol. 11, July 1965, p.p.433–439.CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Blaum M., Farrell P.G., Tilborg H.C.A. Multiple burst error correcting array codes. -“IEEE Transactions on Information Theory”, vol. IT-34, September 1988, p.p.1061–1064.CrossRefGoogle Scholar
  5. 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. 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. 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
  8. 8.
    Forney G.D Jr. Coset codes - Part 1: Introduction and Geometrical Classification. - “IEEE Transactions on Information Theory”, vol. 34, No 5, 1988, p.p.1123–1151.CrossRefMathSciNetGoogle Scholar
  9. 9.
    MacWilliams J.K., Sloane NJ. “The theory of error correcting codes.” New York: North Holland, 1977.MATHGoogle Scholar

Copyright information

© Springer-Verlag Wien 1993

Authors and Affiliations

  • B. Honary
    • 1
  • G. S. Markarian
    • 1
  • L. Kaya
    • 1
  • M. Darnell
    • 2
  1. 1.Lancaster UniversityLancasterUK
  2. 2.University of HullHullUK

Personalised recommendations