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 [2024/11/24 18:07] – 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 15: Line 16:
 ==== Exercises ==== ==== Exercises ====
  
-In a communication system, we want to transmit numbers from 40 to 119 using a fixed-length BCD code with parity checking.+In a communication system, we want to transmit numbers from 40 to 119 using a fixed-length BCD code with parity checking (even parity).
  
 a) What will be the length of the encoded messages if each decimal digit is encoded with 4 bits in BCD encoding? a) What will be the length of the encoded messages if each decimal digit is encoded with 4 bits in BCD encoding?
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 35: Line 36:
 ==== Exercises ==== ==== Exercises ====
  
-Explain Huffman encoding by encoding the message **COMPRESSION_IS_COOL**!+a) Explain Huffman encoding by encoding the message **COMPRESSION_IS_COOL**!
  
-Explain Huffman encoding by encoding the message **HELLO_WORLD_HELLO_EVERYONE**!+b) Explain Huffman encoding by encoding the message **HELLO_WORLD_HELLO_EVERYONE**!
  
 ===== LZW =====  ===== LZW ===== 
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**! 
 + 
 +b) Decode the received message using only the initial dictionary!
  
-1.2. Decode the received message using only the initial dictionary! 
  
 +c) Encode the message **ABRACADABRAABRACADABRA** with LZW coding!
  
-2.1. Encode the message **ABRACADABRAABRACADABRA** with LZW coding!+d) Decode the received message using only the initial dictionary!
  
-2.2. Decode the received message using only the initial dictionary!+/*
  
 ===== RSA ===== ===== RSA =====
-**RSA** (**//Rivest-Shamir-Adleman//**) is a widely used asymmetric cryptographic algorithm that secures data through a pair of public and private keys, enabling secure encryption and decryption. Its strength lies in the difficulty of factoring large prime numbers, providing robust protection for sensitive information. RSA is commonly applied in secure communication protocols, such as SSL/TLS for internet security, digital signatures, and email encryption.+**RSA** (Rivest-Shamir-Adleman) is a widely used asymmetric cryptographic algorithm that secures data through a pair of public and private keys, enabling secure encryption and decryption. Its strength lies in the difficulty of factoring large prime numbers, providing robust protection for sensitive information. RSA is commonly applied in secure communication protocols, such as SSL/TLS for internet security, digital signatures, and email encryption.
  
 ==== Lecture Notes ==== ==== Lecture Notes ====
Line 74: Line 77:
 In an RSA code, **p=11, q=29, e=3, d=187**. After encoding with the public key, we receive the message **81**. What was the original message? In an RSA code, **p=11, q=29, e=3, d=187**. After encoding with the public key, we receive the message **81**. What was the original message?
  
 +*/
tanszek/oktatas/techcomm/encoding_techniques.1732471658.txt.gz · Last modified: 2024/11/24 18:07 by kissa