Advertisement

Some Current Research in Decoding Theory

  • L. D. Rudolph
Part of the International Centre for Mechanical Sciences book series (CISM, volume 216)

Abstract

Two central problems of coding for noisy channels are:
  1. 1.)

    Find high-performance codes

     
  2. 2.)

    Devise efficient but practical decoding methods.

     

Keywords

Parity Check Code Word Cyclic Code Dual Code Parity Check Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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.CrossRefMathSciNetGoogle Scholar
  2. [2]
    Massey, J.L., Threshold Decoding, Cambridge Mass.: M.I.T. Press, 1963.Google Scholar
  3. [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.CrossRefGoogle Scholar
  4. [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 1974CrossRefMathSciNetGoogle Scholar
  5. [5]
    Delsarte, P. “A Geometric Approach to a Class of Cyclic Codes,” J. Combinatorial Theory, vol. 6, pp. 340–358, May 1969.CrossRefMATHMathSciNetGoogle Scholar
  6. [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. [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.CrossRefMathSciNetGoogle Scholar
  8. [8]
    Rudolph, L.D. “A Class of Majority Logic Decodable Codes,” IEEE Trans. on Inform. Theory, vol. IT013, pp. 305–307, April 1967.CrossRefGoogle Scholar
  9. [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. [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. [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

Copyright information

© Springer-Verlag Wien 1975

Authors and Affiliations

  • L. D. Rudolph
    • 1
  1. 1.Systems and Information ScienceSyracuse UniversitySyracuseUSA

Personalised recommendations