tanszek:oktatas:techcomm:encoding_techniques
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| tanszek:oktatas:techcomm:encoding_techniques [2025/11/22 11:53] – [Exercises] kissa | tanszek:oktatas:techcomm:encoding_techniques [2025/11/23 18:43] (current) – [Exercises] kissa | ||
|---|---|---|---|
| Line 2: | Line 2: | ||
| **Encoding techniques** are methods used to convert data into a specific format for efficient storage, transmission, | **Encoding techniques** are methods used to convert data into a specific format for efficient storage, transmission, | ||
| - | In addition to encoding, **encryption** is a crucial technique used to secure data by converting it into a coded format that is only decipherable with the appropriate key, ensuring privacy and protection against unauthorized access. | + | |
| + | /*In addition to encoding, **encryption** is a crucial technique used to secure data by converting it into a coded format that is only decipherable with the appropriate key, ensuring privacy and protection against unauthorized access.*/ | ||
| ===== BCD ===== | ===== BCD ===== | ||
| Line 23: | Line 24: | ||
| c) What will be the entropy and redundancy of this code if the occurrence of numbers in the range 40 $\leq$ n $\leq$ 69 is four times more frequent than the occurrence of numbers in the range 70 $\leq$ n $\leq$ 119? | c) What will be the entropy and redundancy of this code if the occurrence of numbers in the range 40 $\leq$ n $\leq$ 69 is four times more frequent than the occurrence of numbers in the range 70 $\leq$ n $\leq$ 119? | ||
| - | d) How many bits would the messages be if we used pure binary coding with parity checking? | + | d) How many bits would the messages be if we used pure fixed-length |
| ===== Huffman ===== | ===== Huffman ===== | ||
tanszek/oktatas/techcomm/encoding_techniques.1763812389.txt.gz · Last modified: 2025/11/22 11:53 by kissa
