Skip to main content
SpringerLink
Log in

Generating codewords in real space: Application to decoding

  • Section II Information Theory, Decoding And Cryptography
  • Conference paper
  • First Online:
Coding Theory and Applications (Coding Theory 1988)

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

Included in the following conference series:

  • 201 Accesses

Abstract

We consider maximum-likelihood decoding (MLD) of binary linear codes from the viewpoint of space complexity. We discuss the concept of projecting set, enabling MLD by a gradient-like algorithm, and some extensions.

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. R.D. BAKER, "Partitioning the planes of AG2m (2) into 2-designs", Discrete Math. 15 (1976) 205–211.

    Article  Google Scholar 

  2. G. BATTAIL, M. DECOUVELAERE and P. GODLEWSKI, "Replication decoding". IEEE Trans. Inform. Theory, pp.332–345, May 1979.

    Google Scholar 

  3. E.R. BERLEKAMP, R.J. McELIECE and H.C.A. Van TILBORG", On the inherent intractability of certain coding problems", IEE Trans. on Inform. Theory, vol. IT-24, no34, pp.384–386 May 1978.

    Article  Google Scholar 

  4. J. BRUCK and M. NAOR, "The Hardness of decoding linear codes with preprocessing" RJ 6504 (63305) Oct. 1988.

    Google Scholar 

  5. D. CHASE, "A class of algorithms for decoding block codes with channel measurement information", IEEE Trans. Inform. Theory, Vol. IT-18, pp.170–182, Jan. 1982.

    Google Scholar 

  6. P.J. CAMERON and J.H. VAN LINT, "Graph theory, coding theory and block designs", London Math. Soc. Lecture Notes Series 19, Cambridge Univ. Press 1975.

    Google Scholar 

  7. G. COHEN and A. LEMPEL, "Linear intersecting codes", Discrete Math. 56 (1985) 35–43.

    Article  Google Scholar 

  8. G. COHEN, "A nonconstructive upperbound on the covering radius", IEEE Trans. Inform. Theory, Vol. IT-29, no3, pp.352–353, May 1983.

    Article  Google Scholar 

  9. J. FANG, G. COHEN, P. GODLEWSKI and G. BATTAIL, "On the inherent intractability of soft decision decoding of linear codes", Lectures Notes in Computer Science 311; pp. 141–149, 1988.

    Google Scholar 

  10. P. GODLEWSKI, "Sur le plus petit réseau contenant un code binaire", préprint.

    Google Scholar 

  11. T.Y. HWANG, "Decoding linear block codes for minimizing word error rate", IEEE Trans.Inform. Theory, Vol. IT-25, no6 pp.733–737, Nov. 1979.

    Google Scholar 

  12. T.Y. HWANG, "Efficient Optimal decoding of linear block codes", IEEE Trans. Inform. Theory, Vol. IT-26, no5, pp. 603–606, sept. 1980.

    Google Scholar 

  13. T.Y. HWANG, "Soft-decision decoding over the real space", preprint, May 1988.

    Google Scholar 

  14. L.B. LEVITIN and C.R.P. HARTMANN, "A new approach to the general minimum distance decoding problem", IEEE Trans. Inform. Theory, Vol. IT-31, pp. 378–384, May 1985.

    Article  Google Scholar 

  15. F.J. MACWILLIAMS and N.J.A. SLOANE, "The theory of error-correcting codes", North-Holland, New York, 1977.

    Google Scholar 

  16. D. MIKLOS, "Linear binary codes with intersection properties", Discrete Applied Math. 9 (1984) pp.187–196.

    Article  Google Scholar 

  17. L.D. RUDOLPH, C.R.P. HARTMANN, T.Y. HWANG and N.Q. DUC, "Algebraic analog decoding of linear binary codes", IEEE Trans. Inform. Theory, Vol. IT-25, pp.430–440, July 1979.

    Article  Google Scholar 

  18. C.T. RETTER, "Intersecting Goppa codes", IEEE Trans. Inform. Theory, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ENST, 46 rue Barrault, 75634, Paris Cedex 13

    G. D. Cohen, P. J. Godlewski & T. Y. Hwang

Authors
  1. G. D. Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. J. Godlewski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. Y. Hwang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Jacques Wolfmann

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cohen, G.D., Godlewski, P.J., Hwang, T.Y. (1989). Generating codewords in real space: Application to decoding. In: Cohen, G., Wolfmann, J. (eds) Coding Theory and Applications. Coding Theory 1988. Lecture Notes in Computer Science, vol 388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019851

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46726-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation