Skip to main content
SpringerLink
Log in

On generalised concatenated codes

  • Conference paper
  • First Online:
Crytography and Coding (Cryptography and Coding 1997)

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

Included in the following conference series:

  • 114 Accesses

Abstract

The Authors investigate a novel application of generalised concatenated coding theory to the E.S.A. Coding standard. The proposed coding and decoding system is compared to the E.S.A. coding standard, with both systems having the same coding rate. A number of RS codes are used in the system, each capable of correcting a different number of errors. The performance of the system is compared with and without feedback between the decoding modules. The system with feedback is shown to out perform the E.S.A. standard telemetry coding scheme. Different system configurations have been simulated and compared to find an optimum solution.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. D. Forney, Jr., ‘Concatenated Codes', MIT Press, Cambridge, Mass., USA, 1966

    Google Scholar 

  2. P. Elias, ‘Coding for Noisy Channels — IRE Convention Record', Part 4, pp. 37–46, March 1955.

    Google Scholar 

  3. D. W. Hagelbarger, ‘Recurrent Codes: Easily Mechanized, Burst — Correcting Binary Codes', BSTJ, Vol. 38, No. 4, pp. 969–984, July 1959

    Google Scholar 

  4. B. B. Zayblov and E.L. Blokh: ‘Linear Concatenated Codes', Moscow, 1982

    Google Scholar 

  5. Martin Bossert,'Concatenation of Block Codes', DFG Report, 1988

    Google Scholar 

  6. ESTEC: ‘Telemetry Channel Coding Standard'', European Space Agency, ESA PSS-04-103 Issue 1, September 1989

    Google Scholar 

  7. ESTEC, ‘Telemetry Channel Coding', European Space Agency, ESA CCSDS 101.0-B-2, January 1987

    Google Scholar 

  8. Viterbi, A. J., ‘Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm', IEEE Trans. Inf. Theory, vol. IT13, April 1967, pp.260–269

    Article  Google Scholar 

  9. Joachim Hagenauer, ‘Iterative Decoding of Binary Block and Convolutional’

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lancaster Communications Research Centre, Lancaster University, UK

    S. Sonander & B. Honary

Authors
  1. S. Sonander
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Honary
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Darnell

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sonander, S., Honary, B. (1997). On generalised concatenated codes. In: Darnell, M. (eds) Crytography and Coding. Cryptography and Coding 1997. Lecture Notes in Computer Science, vol 1355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024476

Download citation

  • DOI: https://doi.org/10.1007/BFb0024476

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63927-5

  • Online ISBN: 978-3-540-69668-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation