Information Theory Trivia Questions
- ❓ 106+ questions
- 🗂️ Mathematics
- 🎚️ Easy to expert
- ✨ Free to play
Quantification of information. Play Information Theory trivia solo to sharpen your knowledge, or challenge a friend head-to-head in Trivia Tango — every question comes with an explanation so you learn as you play. Questions span every level, from easy warm-ups to expert-level stumpers, so there's a real challenge here however much you already know.
Already playing?
Sample Information Theory Quiz Questions
A mix of easy, medium and hard — questions run from warm-up to expert, so there's a real challenge at every level. Think you know the answers? Play to find out.
This scientist, who worked at Bell Labs, is known as the "father of information theory" for his 1948 paper.
Difficulty: Easy- Claude Shannon
- Alan Turing
- John von Neumann
- Norbert Wiener
This compression algorithm, invented by two Israeli researchers in 1977, replaces repeated patterns with references to earlier occurrences.
Difficulty: Medium- Huffman algorithm
- LZ77
- Burrows-Wheeler transform
- PPM
This result establishes that lossy compression with side information at the decoder achieves the same rate as if the encoder also had the side information.
Difficulty: Hard- Slepian-Wolf theorem
- Wyner-Ziv theorem
- Cover-El Gamal theorem
- Berger-Tung theorem
This is the maximum rate at which information can be reliably transmitted over a communication channel.
Difficulty: Easy- Channel capacity
- Baud rate
- Signal strength
- Compression ratio
This error-correcting code, widely used in CDs and DVDs, can correct burst errors by treating data as polynomials over finite fields.
Difficulty: Medium- Hamming code
- BCH code
- Reed-Solomon code
- Turbo code
This exponent, derived from the random coding argument, gives an achievable lower bound on the reliability function for rates below capacity.
Difficulty: Hard- Sphere-packing exponent
- Straight-line exponent
- Expurgated exponent
- Random coding exponent
Eight bits grouped together form this common unit of digital information, often used to represent a single character.
Difficulty: Easy- Kilobit
- Megabyte
- Nibble
- Byte
This term describes the minimum number of bit changes needed to transform one codeword into another valid codeword in an error-correcting code.
Difficulty: Medium- Hamming distance
- Euclidean distance
- Manhattan distance
- Levenshtein distance
Think You Know Information Theory?
Play a free round in your browser, learn something new with every answer, and challenge your friends to beat your score.
Or get the app