User Tools

Site Tools


tanszek:oktatas:techcomm:syntax

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:syntax [2024/10/07 09:36] – kneheztanszek:oktatas:techcomm:syntax [2026/10/19 17:51] (current) – knehez
Line 1: Line 1:
 [[Code]] [[Code]]
 +
 +Overview of various encoding techniques, focusing on transforming information into symbolic representations like Morse code, fixed-length, and variable-length codes. It also discusses the principles of encoding systems used in technology and communication.
  
 [[Shanon-Fano method | Shannon-Fano method]] [[Shanon-Fano method | Shannon-Fano method]]
 +
 +The Shannon-Fano method is a basic data compression technique where symbols are arranged by their probability of occurrence. The goal is to assign shorter codes to more frequent symbols, optimizing data encoding efficiency
  
 [[Encoding integers]] [[Encoding integers]]
  
-[[BCD encoding]] +Explains various methods for encoding integers, focusing on binary representation and how to handle both positive and negative numbers using sign-magnitude and two's complement methods. It includes practical examples, such as converting between decimal and binary systems and performing arithmetic with binary numbers.
- +
-[[Fixed-Point Number Representation]]+
  
 [[Floating-Point representation]] [[Floating-Point representation]]
 +
 +Explains how real numbers are stored using the IEEE 754 standard. The number is divided into sign, exponent, and mantissa for efficient handling of large or small values.
 +
 +[[BCD encoding]]
 +
 +Representing each decimal digit (0-9) with a 4-bit binary sequence, BCD simplifies conversion between binary and decimal
  
 [[Parity Check]] [[Parity Check]]
  
-[[Error detection and correction]]+A simple error detection method used in data transmission and storage, ensuring data integrity by verifying the even or odd number of 1 bits in binary sequences.
  
-[[Reed-Solomon codes]]+[[Error detection and correction]]
  
-[[Huffman codes]]+Techniques like Elias-style block protection and Hamming codes are explained, focusing on detecting and correcting single-bit errors to maintain data integrity during transmission
  
-[[RLE coding]]+[[Checksum]]
  
-[[LZW coding]]+A checksum is a small value calculated from a sequence of data. It helps us detect accidental changes during storage or transmission.
  
-[[Multimedia compression]]+[[Luhn algortithm to protect Credit card numbers|Luhn algorithm to protect Credit card numbers]]
  
-[[Jpeg compression]]+We can use the Luhn algorithm to check if a credit card number is valid. 
tanszek/oktatas/techcomm/syntax.1728293760.txt.gz · Last modified: by knehez