tanszek:oktatas:techcomm:conditional_probability_and_information_theory
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| tanszek:oktatas:techcomm:conditional_probability_and_information_theory [2025/11/10 18:24] – kissa | tanszek:oktatas:techcomm:conditional_probability_and_information_theory [2025/11/10 18:56] (current) – kissa | ||
|---|---|---|---|
| Line 15: | Line 15: | ||
| - What is the information content if we select 5 out of 10 units and all are defect-free? | - What is the information content if we select 5 out of 10 units and all are defect-free? | ||
| - In a manufacturing process, the expected defect rate is 0.25. After producing 20 units, we randomly and simultaneously select 2 of them and inspect them: | - In a manufacturing process, the expected defect rate is 0.25. After producing 20 units, we randomly and simultaneously select 2 of them and inspect them: | ||
| - | - How many bits of information has the news that $\text{" | + | - How many bits of information has the news that $\text{" |
| - | - How many elements does the news set have (i.e., what are the number of possible outcomes)? What is the entropy of the set? //(n=3; H=1.22 bits)// \\ \\ | + | - How many elements does the news set have (i.e., what are the number of possible outcomes)? What is the entropy of the set? //(n=3; H=1.23 bits)// \\ \\ |
| - In a communication system, we want to transmit 2-character symbolic words using the characters $A$, $B$, and $C$, with each word having equal probability, | - In a communication system, we want to transmit 2-character symbolic words using the characters $A$, $B$, and $C$, with each word having equal probability, | ||
| - How many such symbolic code words can be formed? //(9)// | - How many such symbolic code words can be formed? //(9)// | ||
tanszek/oktatas/techcomm/conditional_probability_and_information_theory.1762799076.txt.gz · Last modified: 2025/11/10 18:24 by kissa
