eduKate Singapore

VIEW THIS AS

Auto mode follows the Route Engine until you choose a viewpoint.

YOU ARE HERE

ROUTE CHECK

CONNECTED TO

WHAT NEXT

Use the canonical route for this room, or HELP if you are unsure.

Next useful routeCanonical hubHELP

Mathematics in Bukit Timah | Hamming Distance, Parity Checks and Error-Correcting Codes

—

by

eduKate Asia
Original illustration of a security analyst reviewing information access, system resilience and data safeguards in an office.

Did you know that adding three carefully chosen check bits to four information bits can allow a mathematical receiver to locate and repair one flipped bit? The trick is not guessing which bit looks wrong. It is creating overlapping parity equations that give every one of seven positions a different error signature. This is the idea behind the Hamming (7,4) code, a classic example of mathematics making information more reliable.

This Mathematics in Bukit Timah lesson builds from binary digits, parity and Hamming distance to the Hamming bound, single-error correction, syndrome decoding, coding rate and the limits of error-detection claims. All devices, messages, bits and classroom experiments are invented educational examples. They are not records of Bukit Timah school systems, pupil data, communications security or actual network performance. The work is advanced mathematical enrichment linked to school-level powers, sets and modular arithmetic.

Quick answer: Hamming distance counts the positions where two equal-length strings differ. For 101101 and 100111, the differing positions are three and five, so the distance is two. In a (7,4) Hamming code, four data bits become a seven-bit codeword with three check bits. Valid codewords have minimum Hamming distance three, allowing guaranteed correction of any single bit flip under the assumed error model, but not guaranteed correction of two simultaneous flips.

Article contents

Original illustration of a specialist reviewing reliable information systems, accompanying fictional Hamming distance and parity-check exercises rather than any real communication measurement.

What problem are error-correcting codes trying to solve?

A digital message is represented by symbols. In the simplest case, each symbol is zero or one.

During transmission or storage, a symbol may be recorded incorrectly. A code adds structured redundancy so that the received pattern contains enough constraints to detect or sometimes correct certain errors.

Redundancy is not the same as repeating every message indefinitely. The design question is how many additional bits are needed for the desired protection.

Why the Bukit Timah context remains fictional

A learner near Sixth Avenue, Beauty World or King Albert Park may use a laptop or study basic computing.

But no real network error rate is supplied here. Every transmitted bit and imagined computer fault is part of a mathematical classroom experiment.

The formulas establish correction properties of a defined code, not the reliability, security or safety of any real educational device.

Binary strings are ordered sequences

The string 1011 contains four positions, read left to right.

The digits are binary symbols, but the string need not be interpreted as the binary number eleven. In coding theory it can be a four-symbol data word.

Position matters. Changing the second digit gives a different word from changing the fourth, even if the total number of ones remains the same.

Worked example 1: count differences

Compare 101101 and 100111.

Position one: same. Position two: same. Position three: 1 versus 0, different. Position four: same. Position five: 0 versus 1, different. Position six: same.

Therefore their Hamming distance is two. It is a count of differing coordinates, not the numerical difference between the binary integers.

Hamming distance only compares equal-length words

The ordinary Hamming distance between two strings is defined when their lengths match.

If one word has four bits and another has five, a location-by-location comparison is incomplete unless a padding or alignment rule is introduced.

Other string metrics allow insertions and deletions. Hamming distance is designed for substitutions in fixed positions.

The distance can be zero

Every string has distance zero from itself because no positions differ.

For distinct equal-length binary strings, distance is at least one. It cannot be negative.

The distance is also symmetric: d(a,b)=d(b,a), because disagreement at a position does not depend on which string was named first.

Worked example 2: find a maximum distance

Compare 0000 and 1111.

All four positions differ, so d=4.

For words of length four, this is the greatest possible Hamming distance. The distance can never exceed the number of positions available for disagreement.

Hamming weight counts ones, not differences

The Hamming weight of a binary string is the number of ones in it.

For word 101101, the weight is four. Its distance from the all-zero word 000000 is also four.

That equality holds because every one differs from the corresponding zero. But weight and pairwise distance are different definitions in general.

Worked example 3: weight and distance

For a=1011, weight(a)=3. For b=1101, weight(b)=3.

Compare their positions: position two differs and position three differs, while positions one and four match.

Thus d(a,b)=2, even though both words have weight three. Equal weights do not mean equal words.

A simple parity bit checks evenness

An even-parity scheme appends one check bit so that the total number of ones is even.

If the original data are 1011, there are three ones. Append parity bit one to obtain 10111, whose four ones give even parity.

This check is a constraint that a receiver can recompute. It does not tell the receiver where a single error occurred.

Worked example 4: an even-parity word

Transmit 10111. Suppose the third bit flips, producing 10011.

The received word has three ones, which is odd. The parity check fails.

The receiver can detect that the even-parity rule was violated, but the parity result by itself does not identify which of the five positions flipped.

A single parity bit misses some errors

If two bits flip, the parity of the number of ones can remain unchanged.

For example, transmit 10111, then flip positions two and three to receive 11011.

Both words have four ones, so the even-parity check passes despite two errors. Thus a simple parity bit cannot detect every possible multi-bit corruption.

Worked example 5: count undetected even flips

A binary even-parity code accepts every word with an even number of ones.

Flipping an even number of positions preserves parity. Flipping an odd number changes parity.

Therefore the single check detects all odd numbers of bit substitutions but can miss even numbers, including two. The result follows from parity arithmetic modulo two.

Addition modulo two is XOR

In binary parity calculations, combine bits with exclusive OR, also called XOR.

The rules are 0⊕0=0, 0⊕1=1, 1⊕0=1 and 1⊕1=0.

XOR of several bits is zero when the number of ones is even, and one when the number is odd. No carrying into a higher binary position occurs.

Worked example 6: check an XOR sum

Compute 1⊕0⊕1⊕1.

The four bits contain three ones, so their parity is odd and the XOR result is 1.

Alternatively 1⊕0=1, then 1⊕1=0, then 0⊕1=1. Both approaches agree.

Why more parity equations can locate an error

A single parity check supplies only one bit of information: pass or fail.

Three overlapping parity checks can produce up to eight distinct binary patterns. Seven nonzero patterns can be assigned to seven bit positions.

If each position participates in a unique combination of checks, one flipped position produces a signature identifying it.

Hamming (7,4) has four data bits and three checks

A seven-bit Hamming word carries four information bits and three check bits in the ordinary systematic arrangement.

Positions 1, 2 and 4 are parity positions. Positions 3, 5, 6 and 7 hold the data.

This is a convenient positional convention, not the only possible ordering of code coordinates. Our calculations use positions numbered from left to right starting at one.

Why positions one, two and four?

Their position numbers are powers of two: 1,2,4.

Every position number from one through seven can be expressed by three binary digits. A parity check is associated with each bit of that position number.

The three check results can then reconstruct the number of a position that has flipped.

The first parity equation

For even-parity Hamming (7,4), parity check s₁ covers positions 1,3,5,7.

The XOR of those four positions should equal zero for a valid codeword.

Position one is chosen to make the overall XOR even, based on the data at positions 3,5,7.

The second parity equation

Parity check s₂ covers positions 2,3,6,7.

Its XOR must also equal zero.

The overlap with the first check is deliberate. Position three, for example, participates in both s₁ and s₂, producing a distinctive syndrome when it flips.

The third parity equation

Parity check s₄ covers positions 4,5,6,7.

A valid codeword satisfies all three checks simultaneously.

Position six participates in s₂ and s₄, but not s₁. Its error signature is therefore 110 in the order (s₄,s₂,s₁), which is binary six.

Worked example 7: choose the four data bits

Let the four fictional data bits, placed in positions 3,5,6,7 respectively, be 1,0,1,1.

We have provisional positions: 1=?, 2=?, 3=1, 4=?, 5=0, 6=1, 7=1.

Now choose parity bits at positions one, two and four to make each covered group have even parity.

Calculate parity position one

Check one covers positions 1,3,5,7, containing unknown p₁ and data bits 1,0,1.

The known bits have two ones, already even. Therefore p₁=0.

The parity group becomes 0,1,0,1, with XOR zero.

Calculate parity position two

Check two covers positions 2,3,6,7: unknown p₂ together with 1,1,1.

Three known ones give odd parity. Therefore p₂=1 makes four ones and even parity.

The group becomes 1,1,1,1, XOR zero.

Calculate parity position four

Check four covers positions 4,5,6,7: unknown p₄ with data bits 0,1,1.

Two known ones already give even parity, so p₄=0.

The group becomes 0,0,1,1, XOR zero.

Worked example 8: assemble the full codeword

Positions 1 through 7 are now:

0,1,1,0,0,1,1.

The transmitted codeword is 0110011. The data still occupy positions 3,5,6,7: 1011.

All three overlapping parity equations pass. This exact string will anchor the error-correction example.

A receiver recomputes the syndrome

The receiver does not need to know which bit was intended in order to check parity.

It recomputes the XOR over each specified group, producing values s₁,s₂,s₄.

The ordered pattern (s₄,s₂,s₁) is called a syndrome. When no error is detected, all three values are zero. A nonzero syndrome can identify a single flipped position under the code’s assumptions.

Worked example 9: flip position six

The valid codeword was 0110011.

Flip bit six, changing its value from one to zero. The received word becomes 0110001.

There is exactly one bit substitution. The next step is to recompute all three parity checks, without presuming the receiver knows the error location.

Check s one after the flip

On received word 0110001, positions 1,3,5,7 contain 0,1,0,1.

Their XOR is zero, so s₁=0.

Position six is not part of the first check. That is why this parity equation remains satisfied.

Check s two after the flip

Positions 2,3,6,7 contain 1,1,0,1.

Three ones have odd parity, so s₂=1.

The second parity equation detects a problem because position six is among its covered positions.

Check s four after the flip

Positions 4,5,6,7 contain 0,0,0,1.

One one means odd parity, so s₄=1.

Therefore the complete syndrome is (s₄,s₂,s₁)=(1,1,0).

Worked example 10: locate and repair the error

Syndrome 110₂ represents decimal position six.

Flip the sixth received bit back from zero to one. Word 0110001 returns to 0110011, the valid original codeword.

Extracting data positions 3,5,6,7 now gives 1011, the intended information in this single-error example.

A zero syndrome has a limitation

A zero syndrome means every parity equation is satisfied.

It does not prove that the received word is identical to the transmitted word when multiple flips are possible. Some multi-bit error patterns transform one valid codeword into another valid codeword.

The code guarantees correction of one substitution, not immunity to arbitrary corruption.

Minimum code distance controls protection

A code is a set of permitted codewords. Its minimum Hamming distance dmin is the smallest distance between two distinct permitted codewords.

For the ordinary (7,4) Hamming code, dmin=3.

This means every pair of valid codewords differs in at least three positions. A received word only one bit away from a codeword cannot be simultaneously one bit away from another valid codeword.

Worked example 11: why one-bit correction is unique

Suppose two valid codewords are at least three positions apart.

If one received word were within one flip of both, the triangle inequality would put the two codewords at distance at most two.

That contradicts dmin≥3. Thus any received word with one or fewer flips from its transmitted codeword has a unique valid codeword within that radius.

The general error-correction rule

A code with minimum Hamming distance dmin can uniquely correct up to

t=floor((dmin−1)/2)

arbitrary substitution errors under nearest-codeword decoding.

For dmin=3, t=floor(2/2)=1. This is why Hamming (7,4) guarantees single-bit correction.

The formula is a guarantee, not a claim that larger errors are never corrected by chance.

The error-detection rule

A code with minimum distance dmin can detect every nonzero error pattern of Hamming weight at most dmin−1, if the receiver checks whether the received word is valid and treats invalid words as errors.

For dmin=3, all one-bit and two-bit errors move a valid word to an invalid word.

However, a decoder that automatically corrects a nonzero syndrome as though it always represents a single error may miscorrect a two-bit error. Detection and correction policies must be distinguished.

Worked example 12: why two flips confuse correction

Suppose the valid word 0110011 experiences flips at positions one and two.

The syndrome is XOR of their position labels: binary 001⊕010=011, which points to position three.

A naive single-error corrector would flip position three, producing a different three-bit error pattern rather than restoring the original. The code cannot guarantee repair of the two original flips.

The Hamming bound counts nearby words

A binary codeword of length seven has one word at distance zero—namely itself.

It has seven words at distance one, because any one of seven positions may flip.

So the radius-one Hamming ball contains 1+7=8 words. For a code that corrects one error, these balls around distinct valid codewords must not overlap.

Worked example 13: count all seven-bit words

There are 2⁷=128 possible binary words of length seven.

A (7,4) Hamming code has 2⁴=16 valid codewords, one for each four-bit data input.

Each valid codeword has eight words in its radius-one ball. Thus 16×8=128. The one-error neighbourhoods exactly fill the space in this classic perfect-code construction.

“Perfect” does not mean perfect communication

The term perfect code means its error-correction balls fill the ambient word space without overlap or gaps at the stated correction radius.

It does not guarantee correction of two or more errors, immunity to malicious interference or perfect real-world reliability.

Technical words must be interpreted according to their formal definitions rather than their everyday emotional connotations.

Hamming (7,4) has a coding rate

A block code that maps k information bits into n transmitted bits has rate R=k/n.

For Hamming (7,4), R=4/7≈0.5714, meaning about 57.14% of transmitted bit positions represent original information and the rest represent parity redundancy.

The added checks improve error correction but increase the length of the transmitted block.

Worked example 14: count redundancy

Four data bits become seven transmitted bits.

There are three extra parity bits. The expansion factor in transmitted length is 7/4=1.75.

This is not a 75% rate; the coding rate is the reciprocal fraction 4/7. State which ratio is being requested.

Extended Hamming adds another parity check

An extended Hamming (8,4) code adds one overall parity bit to a seven-bit Hamming code.

Its minimum distance becomes four under the standard extended construction. This supports single-error correction and double-error detection, often abbreviated SECDED.

It does not guarantee correction of two errors. An extended code trades one more bit of redundancy for stronger error classification.

Worked example 15: extend our codeword

Our seven-bit codeword 0110011 contains four ones, already even.

Append overall even-parity bit zero, producing 01100110.

The extended codeword has eight positions, four of which carry original data. Its rate is 4/8=1/2.

The overall parity check distinguishes cases

In a standard SECDED decoding scheme, the three Hamming checks and the overall parity check are interpreted together.

A single flipped bit changes overall parity and creates an appropriate syndrome, or isolates the extra overall check bit.

A double flipped pair preserves overall parity while ordinarily producing a nonzero Hamming syndrome. This can flag a double error without pretending its positions can be uniquely repaired.

Worked example 16: flip two bits in the extended word

Start from the extended word 01100110.

Flip two positions among the seven Hamming bits, such as positions one and two. Overall parity remains even because two bits changed.

The three Hamming checks give a nonzero syndrome, but the overall parity check does not indicate an odd number of errors. The decoder can report a detected uncorrectable double-bit error rather than making a wrong single-bit correction.

Four parity checks do not solve arbitrary corruption

The extended code’s guarantees are bounded by its minimum distance.

Some error patterns of four or more flips can transform one valid codeword into another. With no additional information, the receiver cannot know which was transmitted.

Error-correcting codes manage specified error classes and probabilities; they cannot make an arbitrary noisy channel error-free at zero cost.

A probability model quantifies likely errors

Suppose each bit independently flips with probability p in a hypothetical binary symmetric channel.

For a seven-bit block, the probability of no flips is (1−p)⁷.

The probability of exactly one flip is 7p(1−p)⁶, because there are seven possible error positions with the same probability. These formulas assume independent equal-rate flips.

Worked example 17: one-percent independent bit errors

Take p=0.01.

Probability of zero errors is 0.99⁷≈0.932065.

Probability of exactly one error is 7(0.01)(0.99)⁶≈0.065899.

Thus probability of at most one flip is approximately 0.997965. Under the stated channel model, every such block is correctable by the (7,4) code.

The probability calculation is not a field reliability claim

Real channels may have bursts, correlations, unequal error rates, synchronization failures and other faults.

Our simple model assumes independent per-bit substitutions. Its 99.8%-like result is not a measured reliability of any device in Bukit Timah.

If errors arrive in bursts or as insertions and deletions, the probability and code behaviour may be different.

Bursty errors challenge simple distance guarantees

A Hamming code’s distance guarantee covers a number of bit flips, irrespective of their positions.

But a burst may flip several nearby bits in one incident. Even when one burst is one event, it can represent more than one symbol error.

Other codes and interleaving methods may be designed for such environments. The right protection depends on the channel model.

Hamming distance and geographic distance differ

The word distance appears in many areas of Mathematics.

Euclidean distance measures geometric separation between points. Hamming distance counts coordinate disagreements between equal-length strings.

Neither is automatically a measure of message meaning or physical travel. A binary word may differ by one bit yet represent a completely different application-level value.

Worked example 18: binary numeric difference versus Hamming distance

Compare 0111₂ (numeric value seven) and 1000₂ (numeric value eight).

Their numeric difference is just one, but every one of the four bits differs, so Hamming distance is four.

Conversely 0000₂ and 1000₂ differ by eight numerically but have Hamming distance one. Define the metric before interpreting “closeness”.

Coding and encryption solve different problems

Error-correcting codes introduce structured redundancy to recover information from certain errors.

Encryption aims to protect confidentiality under a security model. An ordinary Hamming code does not encrypt its data or make the original information secret.

The two techniques may coexist in a communication system, but their guarantees and threat models differ.

Redundancy can be useful without being wasted

A seven-bit codeword carrying four information bits is longer than the original message.

The additional parity positions convey constraints rather than four new independent data bits.

They make it possible to recognise certain deviations from the valid-codeword set. Whether the trade-off is worthwhile depends on the channel, cost and required reliability.

The parity-check matrix is an advanced representation

The three parity equations can be written together as a matrix H whose columns are the nonzero three-bit binary position labels.

For a valid codeword c, Hc=0 over GF(2).

For received word r=c+e, the syndrome is Hr=He because Hc=0. A single flipped bit produces the corresponding column of H, identifying its position.

Worked example 19: the sixth syndrome column

In our convention, position six has binary label 110.

Its parity-check column has entries (s₄,s₂,s₁)=(1,1,0).

Therefore a single error in position six produces syndrome 110. That matches the three explicit XOR checks calculated for received word 0110001.

Calculations occur in a two-element field

In binary linear coding, many algebraic steps use GF(2), the field with elements zero and one.

Addition is XOR and multiplication follows ordinary binary multiplication modulo two. Thus 1+1=0 within this field.

A pupil should not use ordinary integer addition with carrying when calculating a parity-check syndrome.

Worked example 20: syndrome addition modulo two

If an error at position one contributes syndrome 001 and an error at position two contributes 010, their combined syndrome is

001⊕010=011.

This is the same as position three’s single-error signature. The ambiguity explains why the ordinary three-check decoder cannot always distinguish a double error from a single error.

A code’s minimum distance matters more than its visual pattern

Two codewords may look similar or different to a human reader.

The formal guarantee comes from the smallest Hamming distance between any two distinct valid codewords, not the average distance or an attractive symmetry in one pair.

A code’s design must therefore consider the entire set of permitted words, not only a few examples.

Testing one valid word is not a proof for all messages

Our encoded data 1011 produced 0110011, and the one-error decoding worked.

That is an example, not a general proof. The general minimum-distance argument shows why every codeword in the (7,4) Hamming code has the one-error correction property.

This distinction mirrors the broader Mathematics habit of using examples to test and general structure to prove.

Common error 1: compare binary numeric values

A pupil subtracts 0111 from 1000 as integers and reports Hamming distance one.

But all four bit positions differ, so the Hamming distance is four.

The repair is to compare positions, not the represented binary numbers.

Common error 2: count data and parity positions in the wrong places

In our convention the parity positions are one, two and four; the data occupy three, five, six and seven.

Moving the data without updating the check equations changes the codeword.

Write the seven numbered slots before choosing parity values.

Common error 3: forget that XOR of two ones is zero

Ordinary integer addition gives 1+1=2.

Parity algebra works modulo two, so 1⊕1=0. Failing to reduce modulo two produces incorrect parity bits and syndromes.

The learner should practise even/odd reasoning before attempting full matrix decoding.

Common error 4: read the syndrome in the wrong order

Our syndrome is written (s₄,s₂,s₁) when interpreted as a binary position number.

The result 110₂ means decimal six. Reversing the order could produce 011₂, decimal three, and miscorrect a different position.

State the convention explicitly and keep it throughout the exercise.

Common error 5: treat two-bit errors as correctable by Hamming (7,4)

The ordinary Hamming (7,4) code has minimum distance three, guaranteeing one-error correction.

Two flips can imitate another single-error syndrome. A decoder that blindly flips the indicated position may produce the wrong codeword.

Differentiate error detection from guaranteed error correction, and recognise when an extended SECDED construction is needed.

Common error 6: assume a valid received word proves no corruption

A received word that satisfies all parity equations is a valid codeword.

However, certain multi-bit errors can convert one valid codeword into a different valid codeword. The receiver may then fail to notice corruption.

A zero syndrome proves code membership, not identity with the originally sent word under arbitrary errors.

Common error 7: confuse coding rate with correction probability

Coding rate 4/7 describes how many information bits are carried per transmitted bit.

Probability of successful correction depends on the channel error model and decoder behaviour.

The two fractions answer different questions and must not be reported as interchangeable performance measures.

Primary preparation: patterns, parity and place value

Primary learners can count odd and even numbers of counters, compare binary-like sequences and spot one changed symbol.

They need not manipulate parity-check matrices before understanding place values and even–odd classification.

The useful early habit is checking whether a rule applies to all relevant positions rather than relying on appearance.

Lower Secondary: binary, remainders and combinations

Students can study binary place value, powers of two, modular arithmetic and fixed-length strings.

They can compare Hamming distance to ordinary Euclidean distance and count possible one-bit changes in an n-bit string.

These ideas prepare the later coding-theory result that a seven-bit word has seven distinct single-bit neighbours.

Advanced Mathematics and Computing scope

Error-correcting codes use algebra, combinatorics, discrete probability and finite fields. Full syndrome decoding is generally enrichment rather than a compulsory general G3 Mathematics topic.

The SEAB 2027 G3 syllabus directory identifies current Singapore school syllabuses; learners interested in later mathematics and computing can follow the relevant course requirements.

This article’s codewords are original educational constructions and not claims about real eduKateSG software systems.

A twenty-minute home diagnostic

Minutes 1–5: Find Hamming distance between 101101 and 100111 and explain why the answer is two.

Minutes 6–10: Practise even parity and XOR for a four-bit data word. Write parity positions 1,2,4 on a seven-slot template.

Minutes 11–15: Encode data 1011 to obtain 0110011. Confirm all three parity groups have even counts of ones.

Minutes 16–20: Flip bit six to receive 0110001, find syndrome 110₂ and repair position six. Then ask why the same decoder cannot promise to fix every two-bit error.

Seven days of practice and retrieval

Day one counts differences and weights. Day two practises XOR.

Day three constructs even-parity words. Day four encodes Hamming (7,4). Day five calculates a single-error syndrome.

Day six compares minimum distance, detection and correction guarantees. Day seven studies a two-error failure and a fictional independent-bit error probability, with explicit assumptions.

Practice questions with checked answers

A. Hamming distance between 101101 and 100111? Answer: 2.

B. Hamming weight of 101101? Answer: 4.

C. What is 1⊕1? Answer: 0.

D. Parity positions in the stated (7,4) convention? Answer: 1,2,4.

E. Data 1011 encoded in that convention? Answer: 0110011.

F. Received 0110001: syndrome in order (s₄,s₂,s₁)? Answer: 110₂=6.

G. Minimum distance of ordinary Hamming (7,4)? Answer: 3.

H. Guaranteed number of corrected arbitrary bit flips? Answer: 1.

I. Coding rate of (7,4)? Answer: 4/7.

Frequently asked questions

What is Hamming distance?

The number of positions at which two equal-length words differ.

Why do codes include redundant bits?

Structured redundancy allows certain transmission or storage errors to be detected or corrected under a defined error model.

What is the difference between parity and Hamming coding?

A single parity bit can flag odd numbers of bit flips but does not locate an error. Multiple overlapping Hamming parity checks can identify a single flipped position.

Why are positions 1,2,4 used for parity?

They correspond to powers of two and support unique three-bit check signatures for the seven word positions.

Can Hamming (7,4) correct two-bit errors?

Not with a general guarantee. Its minimum distance three guarantees correction of one bit flip.

What is SECDED?

Single-error correction, double-error detection, commonly realised with extended Hamming codes of minimum distance four.

Is a zero syndrome proof that no error occurred?

No. Some multi-bit error patterns can transform one valid word into another while passing all parity checks.

Does this coding theory provide encryption?

No. Correcting errors and concealing information are different security objectives.

Are these real Bukit Timah technology statistics?

No. All messages, error counts and communication probabilities are fictional mathematical examples.

How can parents recognise understanding?

The learner can explain XOR, label parity groups, construct a valid codeword, compute a one-error syndrome and distinguish detection from guaranteed correction.

Official context and connected Mathematics in Bukit Timah

Consult the SEAB 2027 G3 syllabus directory for Singapore’s school-level course requirements. Full error-correcting code theory is presented as advanced enrichment, not a compulsory G3 chapter.

Read Binary Numbers, Place Value and Digital Patterns, Modular Arithmetic and Check Digits, Information Entropy, Bits and Prefix Codes and Truth Tables and Boolean Conditions for distinct but connected ideas.

The immutable Clementi Secondary 1 Mathematics small-group tutorial reference anchors first-principles explanation, exact checks, careful misconception diagnosis and independent transfer.

The lasting habit is to label positions precisely, work modulo two, verify every parity check, connect correction guarantees to minimum distance and never assume that a code detects or fixes more errors than its design supports.

Companion Mathematics in Bukit Timah articles from this four-part batch: Hypothesis Testing, P-Values, Errors and Statistical Power · Simpson’s Paradox, Weighted Averages and Hidden Groups · Fourier Series, Harmonics and Signal Reconstruction. Together these original guides explore reliable digital coding, statistical evidence, subgroup-weighted interpretation and Fourier signal representation, with worked checks and clearly fictional examples.