Institute of Information Science - University of Miskolc

User Tools

Site Tools

Trace:
tanszek:oktatas:techcomm:encoding_techniques

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
tanszek:oktatas:techcomm:encoding_techniques [2025/11/22 11:30] – [Exercises] kissatanszek: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, or processing. These techniques are widely applied in fields such as telecommunications, data storage, and information security to optimize performance and ensure data integrity. \\ **Encoding techniques** are methods used to convert data into a specific format for efficient storage, transmission, or processing. These techniques are widely applied in fields such as telecommunications, data storage, and information security to optimize performance and ensure data integrity. \\
-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 binary coding with parity checking?
  
 ===== Huffman ===== ===== Huffman =====
Line 52: Line 53:
 ==== Exercises ==== ==== Exercises ====
  
-1.1. Explain LZW encoding by encoding the message **ABABABAB**!+a) Explain LZW encoding by encoding the message **ABABABAB**!
  
-1.2. Decode the received message using only the initial dictionary!+b) Decode the received message using only the initial dictionary!
  
  
-2.1. Encode the message **ABRACADABRAABRACADABRA** with LZW coding!+c) Encode the message **ABRACADABRAABRACADABRA** with LZW coding!
  
-2.2. Decode the received message using only the initial dictionary!+d) Decode the received message using only the initial dictionary!
  
 /* /*
tanszek/oktatas/techcomm/encoding_techniques.1763811006.txt.gz · Last modified: 2025/11/22 11:30 by kissa