Skip to main content
SpringerLink
Log in

Constructions for variable-length error-correcting codes

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

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

Included in the following conference series:

Abstract

Two construction techniques for variable-length error-correcting (VLEC) codes are given. The first uses fixed-length linear codes and anticodes to build new VLEC codes, whereas the second uses a heuristic algorithm to perform a computer search for good VLEC codes. VLEC codes may be used for combined source and channel coding. It is shown that over an additive white Gaussian noise channel the codes so constructed can perform better than standard cascaded source and channel codes with similar parameters.

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. D.A. Huffman, “A method for the construction of minimum redundancy codes”, Proc. IRE, Vol. 40, pp. 1098–1101, Sep. 1952.

    Google Scholar 

  2. J.C. Maxted & J.P. Robinson, “Error recovery for variable length codes”, IEEE Trans. Inform. Theory, Vol. IT-31, No. 6, pp. 794–801, Nov. 1985.

    Article  Google Scholar 

  3. V. Buttigieg & P.G. Farrell, “A maximum a-posteriori (MAP) decoding algorithm for variable-length error-correcting codes”, Codes and cyphers: Cryptography and coding IV, Essex, England, The Institute of Mathematics and its Application, pp. 103–119, 1995.

    Google Scholar 

  4. V. Buttigieg & P.G. Farrell, “On variable-length error-correcting codes”, Proc. 1994 IEEE ISIT, Trondheim, Norway, p. 507, 27 Jun.–1 Jul. 1994b.

    Google Scholar 

  5. V. Buttigieg & P.G. Farrell, “Sequential decoding of variable-length error-correcting codes”, Proc. Eurocode 94, Côte d'Or, France, pp. 93–98, 24–28 Oct. 1994c.

    Google Scholar 

  6. V. Buttigieg, “Variable-length error-correcting codes”, Ph.D. Thesis, University of Manchester, England, 1995.

    Google Scholar 

  7. P.G. Farrell & A. Farrag, “Further properties of linear binary anticodes”, Electron. Lett., Vol. 10, No. 16, p. 340, Aug. 1974.

    Google Scholar 

  8. P.G. Farrell, “An introduction to anticodes”, Internal Report, Kent, England, The University of Ken at Canterbury, 1977.

    Google Scholar 

  9. M.A. Bernard & B.D. Sharma, “Variable length perfect codes”, J. Inform. & Optimization Sciences, Vol. 13, No. 1, pp. 143–151, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Communications and Computer Engineering, University of Malta, MSD06, Msida, Malta

    Victor Buttigieg

  2. The Manchester School of Engineering, Simon Building, The University of Manchester, Oxford Road, M13 9PL, Manchester, UK

    Patrick G. Farrell

Authors
  1. Victor Buttigieg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrick G. Farrell
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Colin Boyd

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buttigieg, V., Farrell, P.G. (1995). Constructions for variable-length error-correcting codes. In: Boyd, C. (eds) Cryptography and Coding. Cryptography and Coding 1995. Lecture Notes in Computer Science, vol 1025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60693-9_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-60693-9_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60693-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation