Items without sitelinks
Showing below up to 50 results starting with #201.
- Entropy (information theory) (Q2520)
- Prefix coding (Q2519)
- Example of entropy coding (Q2518)
- Reasons for efficient encoding (Q2517)
- Hamming code (Q2516)
- Determining the redundancy of a code (Q2515)
- Hamming distance (Q2514)
- Bit flips (Q2513)
- Errors in binary encoding (Q2512)
- Using the ISBN for error prevention (Q2511)
- Using the Luhn algorithm for error prevention (Q2510)
- Typical types of errors when writing down numbers (Q2509)
- Use of a hex editor for binary data (Q2508)
- Multiple allocation of the 256 characters (Q2507)
- UTF-8 (Q2506)
- UTF-32 (Q2505)
- OS-specific encoding of line breaks (Q2504)
- Structure of a text file (Q2503)
- Relevance of endianness (Q2502)
- Difference between big-endian and little-endian (Q2501)
- Little-endian notation (Q2500)
- Big-endian notation (Q2499)
- Endianness (Q2498)
- How is data stored digitally? (Q2497)
- Encoding (Q2496)
- Two's complement (Q2495)
- Representation of negative binary numbers (Q2494)
- Causes and solutions for overflow (Q2493)
- Memory order (Q2492)
- Signed and unsigned values (Q2491)
- Baudot Murray code (Q2490)
- Baudot code (Q2489)
- Morse code (Q2488)
- ISO-8859 (Q2487)
- ASCII (Q2486)
- Typical units of measurement in informatics (Q2485)
- Byte (Q2484)
- Data storage (hardware) (Q2483)
- Binary encoding (Q2482)
- Examples of encoding (Q2481)
- Character set (Q2480)
- Syntax (Q2479)
- Semantics (Q2478)
- Semiotics (Q2477)
- MPEG image sequence process (Q2476)
- Principle of frequency masking (Q2475)
- Chroma subsampling using JPEG as an example (Q2474)
- Reasons for color subsampling (Q2473)
- Examples of compression effects (Q2472)
- Lossless graphics compression (Q2471)