Loading
Notes
Study Reminders
Support
Text Version

Information Theory Lower Bounds - Learning Outcomes

Set your study reminders

We will email you at these times to remind you to study.
  • Monday

    -

    7am

    +

    Tuesday

    -

    7am

    +

    Wednesday

    -

    7am

    +

    Thursday

    -

    7am

    +

    Friday

    -

    7am

    +

    Saturday

    -

    7am

    +

    Sunday

    -

    7am

    +

By the end of this module, you will be able to:
• Outline the concept of the information-theoretic lower bounds
• Describe the procedure for deriving lower bounds for compression problem and randomness generation
• Discuss the relationship between Shannon's source coding and Shannon entropy
• Explain the process for deriving lower bounds for random number generation
• Summarize the theorems of strong converse for source coding
• Identify the methods of deriving minmax lower bound for statistical estimation
• Recognize the significance of empirical mean in deriving a lower bound