Skip to main content
SpringerLink
Log in

Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity

  • Conference paper
ICT Innovations 2010 (ICT Innovations 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 83))

Included in the following conference series:

  • 865 Accesses

Abstract

Given a linear [n,Rn,δn] code, we show that for R ≥ δ/2 the time complexity of unique decoding is O(n 2 q nRH(δ/2/R)) and the time complexity of minimum distance decoding is O(n 2 q nRH(δ/R)). The proposed algorithms inspect all error patterns in the information set of the received message of weight less than δn/2 or δn, respectively.

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. Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the Inherent Intractability of Certain Codiig Problems. IEEE Transactions on Information Theory 24(3), 384–386 (1978)

    Article  MATH  Google Scholar 

  2. Barg, A.: Complexity Issues in Coding Theory. In: Brualdi, R.A., Huffman, W.C., Pless, V. (eds.) Handbook of Coding Theory. Elsevier, Amsterdam (1998)

    Google Scholar 

  3. Peterson, W.W., Weldon Jr., E.J.: Error-Correcting Codes, 2nd edn. The Massachusetts Institute of Technology (1996)

    Google Scholar 

  4. Barg, A., Krouk, E., van Tilborg, H.: On the complexity of Minimum Distance Decoding of Long Linear Codes. IEEE Transactions on Information Theory 45(5), 1392–1405 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dumer, I.: Suboptimal decoding of linear codes: Partition technique. IEEE Trans. Inform. Theory 42(6), 1971–1986 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Evseev, G.S.: Complexity of decoding for linear codes. Probl. Inform. Transm. 19(1), 3–8 (in Russian); 1–6 (English translation) (1983)

    MathSciNet  MATH  Google Scholar 

  7. Forney, G.D.: Concatenated Codes. PhD Thesis, Massachusetts Institute of Technology, Cambridge, MA (1965)

    Google Scholar 

  8. Concatenated codes, http://en.wikipedia.org/wiki/Concatenated_error_correction_code

Download references

Author information

Authors and Affiliations

  1. Faculty of Natural Sciences and Mathematics, Institute of Informatics, University Ss. Cyrill and Methodious, Skopje, Macedonia

    Dejan Spasov & Marjan Gusev

Authors
  1. Dejan Spasov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marjan Gusev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Natural Sciences and Mathematics, Institute of Informatics, University Sts. Cyril and Methodius, Arhimedova 5, 1000, Skopje, Macedonia

    Marjan Gusev

  2. Faculty of Technical Sciences, University of St. Kliment Ohridski, Ivo Lola Ribar bb, 7000, Bitola, Macedonia

    Pece Mitrevski

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Spasov, D., Gusev, M. (2011). Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity. In: Gusev, M., Mitrevski, P. (eds) ICT Innovations 2010. ICT Innovations 2010. Communications in Computer and Information Science, vol 83. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19325-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19325-5_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19324-8

  • Online ISBN: 978-3-642-19325-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation