#separator:tab
#html:true
#tags:symbols-and-information-quiz
#columns:Front Back
What is a symbol in the sense of information theory?
- A small picture, such as an icon on a screen.
- A written character such as a letter or a digit, that is, something you can write down.
- An agreed, distinguishable state.
- A single sensor reading, such as a particular brightness.
- An agreed, distinguishable state.
Exactly, and both words matter: distinguishable, since the receiver must reliably tell it apart from all others, and agreed, since without an agreement the state carries no meaning.
A symbol needs both: physics makes it distinguishable, and an agreement gives it a meaning.
Two teams send data with coloured light, and their LED shows four colours they have agreed on. What is the alphabet of their link?
- The 26 letters from A to Z that the link is meant to carry.
- The set of the four colours that both teams have agreed on as symbols.
- The order in which the colours of a message are sent.
- The mapping of the colours to bit sequences, such as green standing for 01.
- The set of the four colours that both teams have agreed on as symbols.
Exactly. How large this set may be is not decided by the agreement alone: the hardware and the surroundings have a say, which makes it a question of measurement.
The alphabet is the stock of agreed symbols, and a code then says what each of them stands for.
"A link sends letters as coloured flashes of light. Who decides that a green flash means ""A""?
- The physics of light: each colour has a fixed wavelength, and from that the receiver recognises which character is meant.
- Sender and receiver together, by an agreement made before the transmission.
- A standard for light transmission that all devices follow so that they understand each other.
- The receiver alone, since it is the side that has to turn readings into characters.
" - Sender and receiver together, by an agreement made before the transmission.
Exactly, and both sides must use exactly the same mapping. In practice this agreement is a piece of documentation and two places in the code, one in the sender and one in the receiver.
Meaning is not in the signal but in an agreement that both sides made beforehand.
"What is a bit?
- A tiny component inside a computer that either passes or blocks current.
- The amount of storage a computer needs for a single character such as ""A"".
- The amount of information in a decision between two equally likely possibilities.
- The smallest brightness a sensor can still measure.
" - The amount of information in a decision between two equally likely possibilities.
Exactly: one yes or no, one on or off. The bit is the smallest currency in which information can be counted, and every larger amount is measured in it.
One bit is the answer to one yes/no question whose two answers are equally likely.
An alphabet has four colours, all equally likely. How much information does a single received symbol carry, and why?
- 4 bits, because each of the four colours is a possibility of its own, and each possibility counts as one bit.
- 2 bits, because two yes/no decisions suffice to determine one of four colours.
- 1 bit, because the receiver makes one decision per symbol: it has arrived or it has not.
- It depends on the colour sent, because an easily recognised colour such as red carries more than a hard one such as yellow.
- 2 bits, because two yes/no decisions suffice to determine one of four colours.
Exactly, and the reasoning is halving: the first question splits the four into two halves, the second hits the colour. Every doubling of the alphabet adds exactly one bit per symbol.
With N equally likely symbols, each carries log₂(N) bits, so four colours carry two.
A link switches from 2 to 8 colours and still sends the same number of symbols per second. How does the transfer time of the same file change?
- It drops to a quarter, because 8 divided by 2 is 4.
- It drops to a third: each symbol now carries 3 bits instead of 1.
- It stays the same, since the symbol rate has not changed.
- It drops to an eighth, one eighth per colour.
- It drops to a third: each symbol now carries 3 bits instead of 1.
Exactly: 2 colours carry 1 bit per symbol, 8 colours carry 3. Same symbol rate, three times the bit rate, a third of the time, provided the eight colours stay distinguishable, which is the limit that the distance between regions sets.
Time follows bits per symbol, log₂(2) = 1 against log₂(8) = 3, so a third.
More symbols per alphabet means more bits per symbol. Why not simply make the alphabet huge, say 256 colours?
- Because a lamp can mix only a limited number of distinct colours from its three channels.
- Because the receiver would need a lookup table for 256 colours whose search per symbol takes too long.
- Because the receiver must still tell the symbols apart reliably: the more there are, the closer their measurement regions crowd together.
- Because an alphabet needs only as many symbols as the text has distinct characters; further colours would go unused.
- Because the receiver must still tell the symbols apart reliably: the more there are, the closer their measurement regions crowd together.
Exactly, and this is where two ideas interlock: the measure of information says what a larger alphabet buys, and the distance between regions says what it costs. Where the balance lies is decided by noise, ambient light and measurement.
A larger alphabet carries more per symbol until noise makes neighbouring symbols indistinguishable.
A receiver recognises every colour without error; recognition accuracy is 100 percent. Yet the resulting text is nonsense. What is the most likely cause?
- The sensor delivers distorted readings, for instance because the gain is set too high.
- Sender and receiver use different mappings from colours to characters.
- Ambient light shifts the readings, so the receiver sees the colours but sorts them into the wrong regions.
- The alphabet has fewer colours than the text has distinct characters, so several characters end up on the same colour.
- Sender and receiver use different mappings from colours to characters.
Exactly: the signal arrives perfectly, but the agreement is broken. Meaning is not in the light but in the mapping, which must be identical on both sides. A classic after sender and receiver code were written separately.
Perfect reception with different tables gives perfect nonsense.
An alphabet has 16 symbols. At most how many yes/no questions are needed to determine a received symbol with certainty?
- 4, because halving four times leads from 16 possibilities to one.
- 8, because each question halves, and half of 16 possibilities is 8.
- 15, because in the worst case you have to rule out 15 symbols one by one.
- 2, because every question has two answers, and two times two answers cover 16.
- 4, because halving four times leads from 16 possibilities to one.
Exactly: 16, 8, 4, 2, 1. The same calculation as guessing a card by halving, and at the same time the statement that a symbol out of 16 carries 4 bits.
The number of halvings is log₂(16) = 4, and that is also the number of bits.
Which statements about bits are true?
- One bit distinguishes exactly two possibilities.
- A bit and a byte denote the same amount, just in different contexts.
- Any information can be represented as a sequence of bits.
- Bits exist only in computers, because only there are states stored electrically.
- A message contains more bits if its content is more important.
- One bit distinguishes exactly two possibilities.
Exactly, that is the definition: on or off, yes or no, bright or dark. - Any information can be represented as a sequence of bits.
Correct, and that is why one and the same technology can carry text, pictures and sound. How the mapping works in detail is a question of codes.
Bits count possibilities, independent of hardware and of importance.
An alphabet has four colours, so each symbol carries 2 bits. A 12-bit identifier is to be transmitted. How many symbols does that take at least?
- 12, one symbol per bit.
- 6, because 12 bits divided by 2 bits per symbol.
- 3, because 12 divided by 4 colours.
- 24, each bit twice to be safe.
- 6, because 12 bits divided by 2 bits per symbol.
Exactly, and this division is half of every throughput calculation: bits divided by bits per symbol gives the number of symbols, and times the seconds per symbol the duration.
Bits divided by bits per symbol gives the number of symbols.
Why is an alphabet of just two symbols in principle enough for any message, however complicated?
- It is not enough: text needs at least 26 symbols.
- Because two symbols lie furthest apart in the signal, so the receiver never confuses them.
- Because every symbol of a larger alphabet can be replaced by a fixed group of two-way symbols; it only costs length.
- Because computers work with two states internally anyway, so every message is already in that form before sending.
- Because every symbol of a larger alphabet can be replaced by a fixed group of two-way symbols; it only costs length.
Exactly, and that is why the bit is the universal currency: everything can be exchanged into binary decisions. For the same reason, a standard defined in bits rather than colours even survives swapping the carrier, say sound instead of light.
What a large alphabet achieves per symbol, two symbols achieve in a group.
"In terms of symbols and information, what does this dictionary establish?
ALPHABET = {
""red"": ""00"",
""green"": ""01"",
""blue"": ""10"",
""yellow"": ""11"",
}
- The four colours a lamp can produce, each with the code the manufacturer assigned to it.
- The agreement: which symbol carries which group of bits. The receiver needs exactly the same mapping, only in reverse.
- The order in which the colours are sent: first red, then green, then blue, then yellow.
- How many symbols are sent per second, because two bits per symbol determine the pace of the transmission.
" - The agreement: which symbol carries which group of bits. The receiver needs exactly the same mapping, only in reverse.
Exactly: this is an alphabet as a code, four symbols of 2 bits each. These lines are one half of the agreement, and if sender and receiver differ in even one entry, perfect reception becomes perfect nonsense.
The dictionary is the agreement in code, and it has to exist identically on both sides.
"Sixteen faces, one of them is the secret. Question A is ""does it wear glasses?"", and eight of the sixteen do. Question B is ""is it face number 7?"". Which question is worth more on average?
- Question A: it yields a guaranteed 1 bit, question B only about a third of that on average.
- Question B: a yes solves the puzzle completely at once, which A can never do.
- Both the same: they are both yes/no questions, and a yes/no answer is one bit.
- That depends on luck and cannot be said in advance.
" - Question A: it yields a guaranteed 1 bit, question B only about a third of that on average.
Question A halves the field no matter how it turns out: 16 become 8, exactly 1 bit. Question B resolves everything in one case out of sixteen (4 bits) but leaves 15 possibilities in the other fifteen, which buys almost nothing. On average that is about 0.34 bits.
Only a question that splits the field in half is worth a whole bit; the expected value of a lopsided one is far lower.
"In Morse code the most common letter, ""e"", is also the shortest: a single dot. Rare letters like ""q"" are long. Why does that unequal treatment pay off?
- Because short codes are less error-prone, so the most common letter should be the best protected.
- Because ""e"" is the most important letter and important letters should arrive first.
- Because it makes the average message shorter: what occurs often then costs little.
- Because an alphabet with codes of different lengths can hold more letters than one with equal lengths.
" - Because it makes the average message shorter: what occurs often then costs little.
Exactly the point. When letters are not equally likely, a rare letter carries more information than a common one, so it may also take up more room. Every compression scheme rests on that observation.
Frequent symbols get short codes, so the average message gets shorter.
A link can reliably manage only two symbols, bright and dark. It is still supposed to transmit an alphabet of 32 characters by grouping several flashes. How many flashes does one group need at least?
- 16, half the number of characters.
- 5, because two to the fifth is 32.
- 32, because every character needs one flash.
- 6, because one extra place is needed to separate the groups.
- 5, because two to the fifth is 32.
Each flash carries one decision between two possibilities, so one bit; five flashes carry five bits and thus tell 32 groups apart. That is the halving calculation read backwards.
n flashes with two possibilities give 2ⁿ groups, and 2⁵ = 32.