Skip to main content
SpringerLink
Log in

Graph Decoding of Array Error-Correcting Codes

  • Conference paper
  • First Online:
Cryptography and Coding (Cryptography and Coding 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1746))

Included in the following conference series:

Abstract

The motivation for this paper is to report on concepts and results arising from the continuation of a recent study [1] of graph decoding techniques for block error-control (detection and correction) codes. The representation of codes by means of graphs, and the corresponding graph-based decoding algorithms, are described briefly. Results on the performance of graph decoding methods for block codes of the array and generalised array type will be presented, confirming the illustrative examples given in [1]. The main novel result is that the (7,4) Generalised Array Code, equivalent to the (7,4) Hamming Code, which has a graph which contains cycles, can be successfully decoded by means of an iterated min-sum algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P.G. Farrell: Graph Decoding of Error-Control Codes; 5th Int. Symposium on DSP for Communication Systems, Scarborough, Perth, Australia, 1–4 February, 1999.

    Google Scholar 

  2. R.M. Tanner: A Recursive Approach to Low-Complexity Codes; IEEE Trans Info Theory, Vol IT-27,No 5, pp533–547, Sept 1981.

    Article  MathSciNet  Google Scholar 

  3. R.G. Gallager: Low-Density Parity-Check Codes; IRE Trans Info Theory, Vol IT-8,No 1, pp 21–28, Jan 1962.

    Article  MathSciNet  Google Scholar 

  4. N. Wiberg, H.-A. Loeliger & R. Kotter: Codes and Iterative Decoding on General Graphs; Euro Trans Telecom, Vol 6, pp513–526, SEPT 1995.

    Article  Google Scholar 

  5. N. Wiberg: Codes and Decoding on General Graphs; PhD Dissertation, Linkoping University, Sweden, April 1996.

    Google Scholar 

  6. G.D. Forney: On Iterative Decoding and the Two-Way Algorithm; Int Symp on Turbo Codes, Brest, France, Sept 3–5, 1997.

    Google Scholar 

  7. P.G. Farrell: On Generalised Array Codes; in Communications Coding and Signal Processing, Eds B. Honary, M. Darnell and P.G. Farrell, Research Studies Press, 1997.

    Google Scholar 

  8. H.-A. Loeliger, F. Tarkoy, F. Lustenberger & M. Helfenstein: Decoding in Analog VLSI; IEEE Comms Mag, April 1999, pp 99–101.

    Google Scholar 

  9. I. Martin & B. Honary: Two-Stage Trellis Decoding of the Nordstrom-Robinson Code Based on the Twisted Squaring Construction, submitted to IEE Proceedings-Communications.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lancaster University, UK

    Patrick G. Farrell

  2. Curtin University of Technology, Perth, Australia

    Seyed H. Razavi

Authors
  1. Patrick G. Farrell
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seyed H. Razavi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Vodafone Limited, The Courtyard, 2-4 London Road Newbury, Berkshire, RG14 1JX, UK

    Michael Walker

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Farrell, P.G., Razavi, S.H. (1999). Graph Decoding of Array Error-Correcting Codes. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-46665-7_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66887-9

  • Online ISBN: 978-3-540-46665-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation