Skip to main content
SpringerLink
Log in

Coding for Discrete Noiseless Channels

  • Chapter
Basic Concepts in Information Theory and Coding

Part of the book series: Applications of Communications Theory ((ACTH))

  • 337 Accesses

Abstract

Agent 00111 was a legendary master of espionage because he had found answers ( sometimes only partial answers ) to several espionage dilemmas. One answer, discussed in Chapter 1, was an accounting and budgeting system for the amount of delivered information. However, the same principles could also be applied to other problem areas, such as communicating the information he received.

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 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • T. M. Apostol. 1976. Introduction to Analytic Number Theory. Springer-Verlag, UTM.

    MATH  Google Scholar 

  • S. Even. 1963. “Test for Unique Decipherability.” IEEE Trans. Inform. Theory IT-9:109–12.

    Article  MATH  Google Scholar 

  • R. M. Fano. 1961. Transmission of Information. MIT Press and Wiley, New York.

    Google Scholar 

  • E. Gilbert. 1971. “Codes Based on Inaccurate Source Probabilities.” IEEE Trans. Inform. Theory. Vol 15–17:304–14.

    Article  Google Scholar 

  • S. W. Golomb. 1980. “Sources Which Maximize the Choice of a Huffman Coding Tree.” Inf . Contr. 45:263–72.

    Article  MathSciNet  MATH  Google Scholar 

  • G. H. Hardy and M. Riesz. 1952. The General Theory of Dirichlet’s Series. Cambridge, UK: Cambridge University Press.

    Google Scholar 

  • D. A. Huffman. 1952. “A Method for the Construction of Minimum-Redundancy Codes.” Proc. IRE 40:1098–1101.

    Article  Google Scholar 

  • E. T. Jaynes. 1959. “Note on Unique Decipherability.” IRE Transactions on Information Theory IT-5:98–102.

    Article  MathSciNet  Google Scholar 

  • F. Jelinek. 1968. “Buffer Overflow in Variable-Length Coding of Fixed-Rate Sources.” IEEE Trans. Inform. Theory IT-4:490–501.

    Article  Google Scholar 

  • F. Jelinek and K. S. Schneider. 1974. “Variable-Length Encoding of Fixed-Rate Markov Sources for Fixed-Rate Channels.” IEEE Trans. Inform. Theory IT-20:750–55.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Kac. 1947. “On the Notion of Recurrence in Discrete Stochastic Processes.” Bull. Amer. Math. Soc. 53:1002–10, 1947.

    Article  MathSciNet  MATH  Google Scholar 

  • R. M. Karp. 1961. “Minimum-Redundancy Coding for the Discrete Noiseless Channel.” IRE Trans. Inform. Theory IT-7:27–38.

    Article  MathSciNet  MATH  Google Scholar 

  • A. N. Kolmogorov. 1965. “Three Approaches to the Quantitative Definition of Information.” Probl. Inf. Transm. 1:1–7.

    Google Scholar 

  • L. G. Kraft. 1949. “A Device for Quantizing, Grouping, and Coding Amplitude Modulated Pulses.” M.S. thesis, MITl.

    Google Scholar 

  • A. Lempel and J. Ziv. 1976. “On the Complexity of Finite Sequences.” IEEE Trans. Inform. Theory IT-22:75–81.

    Article  MathSciNet  MATH  Google Scholar 

  • A. Lempel and J. Ziv. 1978. “Compression of Individual Sequences via Variable-Rate Coding.” IEEE Trans. Inform. Theory IT-24:530–36.

    Article  MathSciNet  MATH  Google Scholar 

  • A. Lempel and J. Ziv. 1986. “Compression of Two-Dimensional Data.” IEEE Trans. Inform. Theory IT-32: pp. 2–8.

    Article  Google Scholar 

  • B. McMillan. 1956. “Two Inequalities Implied by Unique Decipherability.” IRE Trans. Inform. Theory 2:115–16.

    Article  Google Scholar 

  • P. Martin-Löf. 1966. “The Definition of Random Sequences.” Inf . Contr. 9:602–19.

    Article  Google Scholar 

  • E. Norwood. 1967. “The Number of Different Possible Compact Codes.” IEEE Trans. Inform. Theory IT-3:613–16.

    Article  Google Scholar 

  • M. Rodeh, V. R. Pratt, and S. Even. 1981. “Linear Algorithm for Data Compression via String Matching.” J. Ass. Comput. Mach. 28:16–24.

    Article  MathSciNet  MATH  Google Scholar 

  • A. A. Sardinas and G. W. Patterson. 1953. “A Necessary and Sufficient Condition for the Unique Decomposition of Coded Messages.” 1953 IRE Convention Record, Part 8, 106–08.

    Google Scholar 

  • M. P. Schützenberger and R. S. Marcus. 1959. “Full Decodable Code-Word Sets.” IRE Transactions on Information Theory, vol 5, 12–5.

    Article  Google Scholar 

  • C. E. Shannon. 1948. “A Mathematical Theory of Communication.” Bell Sys. Tech. J. 27:379–423, 623–56.

    MathSciNet  MATH  Google Scholar 

  • T. A. Welch. 1984. “A Technique for High-Performance Data Compression.” IEEE Comput. C17:8–19.

    Article  Google Scholar 

  • A. D. Wyner and J. Ziv. 1989. “Some Asymptotic Properties of the Entropy of a Stationary Ergodic Data Source with Applications to Data Compression.” IEEE Trans. Inform. Theory IT-35:1250–58.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departments of Electrical Engineering and Mathematics, University of Southern California, Los Angeles, California, USA

    Solomon W. Golomb

  2. Racal Research, Limited, Reading, Berkshire, UK

    Robert E. Peile

  3. Department of Electrical Engineering, University of Southern California, Los Angeles, California, USA

    Robert A. Scholtz

Authors
  1. Solomon W. Golomb
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert E. Peile
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert A. Scholtz
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer Science+Business Media New York

About this chapter

Cite this chapter

Golomb, S.W., Peile, R.E., Scholtz, R.A. (1994). Coding for Discrete Noiseless Channels. In: Basic Concepts in Information Theory and Coding. Applications of Communications Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2319-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2319-9_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-3236-5

  • Online ISBN: 978-1-4757-2319-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation