tanszek:oktatas:techcomm:coding
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| tanszek:oktatas:techcomm:coding [2024/10/07 18:14] – knehez | tanszek:oktatas:techcomm:coding [2024/10/08 06:01] (current) – knehez | ||
|---|---|---|---|
| Line 2: | Line 2: | ||
| A lossless compression algorithm that assigns shorter binary codes to more frequent symbols and longer codes to less frequent ones, optimizing the average code length. | A lossless compression algorithm that assigns shorter binary codes to more frequent symbols and longer codes to less frequent ones, optimizing the average code length. | ||
| + | |||
| + | [[Reed-Solomon codes]] | ||
| + | |||
| + | These error-correcting codes are used to detect and fix burst errors in data transmission or storage by working on symbols, not just bits. | ||
| [[RLE coding]] | [[RLE coding]] | ||
tanszek/oktatas/techcomm/coding.1728324848.txt.gz · Last modified: 2024/10/07 18:14 by knehez