Skip to main content

Some Current Research in Decoding Theory

  • Chapter
Coding and Complexity

Part of the book series: International Centre for Mechanical Sciences ((CISM,volume 216))

  • 86 Accesses

Abstract

Two central problems of coding for noisy channels are:

  1. 1.)

    Find high-performance codes

  2. 2.)

    Devise efficient but practical decoding methods.

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

Access this chapter

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. Rudolph L.D. and C.R.P. Hartmann, “Decoding by Sequential Code Reduction,” IEEE Trans. on Inform. Theory, vol. IT-19, pp. 549–555, July 1973.

    Article  MathSciNet  Google Scholar 

  2. Massey, J.L., Threshold Decoding, Cambridge Mass.: M.I.T. Press, 1963.

    Google Scholar 

  3. Rudolph, L.D., and W.E. Robbins, “One-Step Weighted-Majority Decoding,” IEEE Trans. on Inform. Theory, vol. IT-18, pp. 446–448, May 1972.

    Article  Google Scholar 

  4. Robbins, W.E., and L.D. Rudolph, “On Two-Level Exclusive-OR Majority Networks,” IEEE Trans. on Computers, vol. C-23, pp. 34–40, January 1974

    Article  MathSciNet  Google Scholar 

  5. Delsarte, P. “A Geometric Approach to a Class of Cyclic Codes,” J. Combinatorial Theory, vol. 6, pp. 340–358, May 1969.

    Article  MATH  MathSciNet  Google Scholar 

  6. Lin, S. and E.J. Weldon, Jr., “New Efficient Majority-Logic Decodable Cyclic Codes,” presented at the 1972 IEEE International Symposium on Information Theory, Asilomas, Calif.

    Google Scholar 

  7. Hartmann, C.R.P., J.B. Ducey and L.D. Rudolph, “On the Structure of Generalized Finite Geometry Codes,” IEEE Trans. on Information Theory, IT-20, pp. 240–252„ March 1974.

    Article  MathSciNet  Google Scholar 

  8. Rudolph, L.D. “A Class of Majority Logic Decodable Codes,” IEEE Trans. on Inform. Theory, vol. IT013, pp. 305–307, April 1967.

    Article  Google Scholar 

  9. Rudolph, L.D. and C.R.P. Hartmann, “Maximum-Radius Analog Threshold Decoding”, presented at the 1975 IEEE International Symposium on Information Theory, Notre Dame, Ind.

    Google Scholar 

  10. Rudolph, L.D. and C.R.P. Hartmann, “Algebraic Analog Decoding”, presented at the IEEE Information Theory Workshop, Lenox Mass-, June 1975. To be submitted to the IEEE Trans. on Inform. Theory.

    Google Scholar 

  11. Hartmann, C.R.P., and L.D. Rudolph, “On Optimum Symbol-by-Symbol Decoding Rule for Linear Codes”, Submitted to the IEEE Trans. on Inform. Theory.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Wien

About this chapter

Cite this chapter

Rudolph, L.D. (1975). Some Current Research in Decoding Theory. In: Longo, G. (eds) Coding and Complexity. International Centre for Mechanical Sciences, vol 216. Springer, Vienna. https://doi.org/10.1007/978-3-7091-3008-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-3008-7_3

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-81341-6

  • Online ISBN: 978-3-7091-3008-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics