Error checking and correction — AQA A-Level Computer Science
Error checking and correction techniques detect and rectify data corruption caused by electrical interference during transmission or storage. AQA A-Level Computer Science covers parity bits, majority voting, checksums, and check digits, alongside advanced error-correcting codes such as Hamming code.
Error checking and correction explained
Error checking and correction adds redundant information to data so errors from noise, interference or faulty hardware can be detected and sometimes repaired.
Read the full explanation
Describing a method sets out what extra bits are added, where, and how the receiver checks them; explaining justifies why it is used. For parity, one extra bit makes the number of 1s even (even parity) or odd (odd parity); the receiver recounts and flags a mismatch. This detects a single flipped bit but cannot say which bit changed, so it detects rather than corrects. A checksum sums data blocks and compares the total at the receiver. Correction methods such as majority voting or Hamming code add more redundancy to locate and repair errors. Name the method, describe the mechanism in steps, then explain the problem it solves and its limitation.
Your focus
- Describe and explain the use of:
Which command word is this?
Set out the mechanics of a process step-by-step. For parity, explain how the parity bit is calculated before transmission and how the receiver recalculates it to identify discrepancy.
Error checking and correction exam tips
Topic Overview
Data transmitted across physical media or retrieved from storage is subject to attenuation, electromagnetic interference, and cross-talk, which can flip binary states. Error checking and correction protocols ensure data integrity across networks and internal buses by adding structured redundancy to identify or repair corrupted bits.
Within the AQA specification, understanding these techniques bridges foundational data representation with network communication protocols. Mastery of parity bits, majority voting, checksums, and check digits equips students to evaluate the trade-offs between computational overhead, transmission bandwidth, and reliability.
Key Concepts
- →Parity Bits: A single check bit appended to a binary string to ensure the total count of 1s is consistently even or odd; detects an odd number of bit errors but cannot pinpoint bit position.
- →Majority Voting: A forward error correction method where each bit is transmitted multiple times (usually 3), allowing the receiver to take the majority bit; corrects single-bit errors per triplet at the cost of high bandwidth overhead.
- →Checksums: An algorithmically generated numerical value produced from a block of data (such as summing bytes and taking the remainder) transmitted alongside the payload to verify overall block integrity.
- →Check Digits: A calculated digit appended to numeric identifiers (e.g., ISBNs, EAN barcodes) using weighted modulus arithmetic (e.g., Mod 10, Mod 11) to catch human transcription and transmission errors.
Marking Points
- Identifies the method being described and keeps the description focused on that method.
- Describes the mechanism step by step, including what redundant data is added and how the receiver checks it, e.g. a parity bit making the count of 1s even.
- Explains the purpose of the method in terms of the errors it detects or corrects, such as corruption during transmission between two devices.
- States the limitation of the method where relevant, e.g. a single parity bit detects a flipped bit but cannot identify which bit changed.
- Distinguishes error detection from error correction, giving a correction method such as majority voting or Hamming code where correction is claimed.
Examiner Tips
- 💡Name the method first, then describe its mechanism, then explain its purpose.
- 💡Use precise terms such as redundant bits, sender, receiver and transmission.
- 💡Check whether your explanation says why the method works, not only what it does.
- 💡When answering parity questions, explicitly count every single '1' including the parity bit itself, and state whether the sum is odd or even.
- 💡In evaluation questions comparing error detection methods, reference the trade-off between transmission overhead (bandwidth) and the need for a return channel for retransmission requests.
Common Mistakes
- Describes the general idea of error checking without naming or explaining a specific method; name the method and give its mechanism.
- Explains what the method is for without describing how it works; include the steps that make it function.
- Confuses error detection with error correction; state clearly whether the method only detects errors or can also repair them.
- Claims a single parity bit can correct errors; it can only detect an odd number of flipped bits.
- Believing parity bits can catch any number of flipped bits: Parity bits fail completely if an even number of bits flip (e.g., two bits flip from 0 to 1), because the overall parity count remains unchanged.
- Assuming majority voting guarantees error-free communication: If noise bursts corrupt two or three bits within the same three-bit block, majority voting will select the incorrect bit, silently propagating corrupted data.
Revision Plan
- 1Day 1-2: Review binary representation and practise manual parity generation and verification for both even and odd schemes.
- 2Day 3-4: Work through majority voting scenarios, calculating exact bandwidth overhead and identifying failure thresholds.
- 3Day 5-6: Practise check digit algorithms (Mod 10 and Mod 11) using ISBN and barcode calculation examples.
- 4Day 7: Tackle AQA past-paper questions comparing retransmission techniques (ARQ with parity/checksums) against forward error correction.
Exam Question Types
- 📋Parity verification calculations: Given a table of received bytes, state which bytes contain parity errors under even or odd parity.
- 📋Majority voting mechanics: Decoding a bitstream transmitted with triple redundancy and explaining how correction occurs.
- 📋Evaluative comparison questions: 6 to 9-mark questions comparing parity, checksums, and majority voting regarding bandwidth efficiency and reliability.
Command Word Expectations (AQA)
Set out the mechanics of a process step-by-step. For parity, explain how the parity bit is calculated before transmission and how the receiver recalculates it to identify discrepancy.
Perform arithmetic steps clearly. For check digits or checksums, show intermediate products, sums, and modulus operations before stating the final check value.
Identify both similarities and differences between two methods across explicit criteria, such as bandwidth overhead, ability to correct vs detect, and reliance on retransmission.
How Students Lose Marks (Examiner Pitfalls)
Step-by-Step Worked Solutions
Question: A transmission system uses 7-bit ASCII with an odd parity bit added as the most significant bit (MSB). A receiver detects the following byte: 11001010. Determine whether an error has been detected and explain your reasoning.
- 1.Step 1: Count the total number of 1s in the received 8-bit pattern (11001010). The bits are 1, 1, 0, 0, 1, 0, 1, 0, giving a total of four 1s.
- 2.Step 2: Evaluate the parity scheme. The system uses odd parity, which requires the total number of 1s in the transmitted byte to be odd.
- 3.Step 3: Compare received parity with expected parity. Four 1s is an even number, not odd. Therefore, at least one bit has been corrupted during transmission.
- 4.Step 4: Formulate the final conclusion: An error is detected because the byte contains an even number of 1s when odd parity was expected.
Question: A system uses majority voting where each bit is transmitted three times. The received stream for a 3-bit message is: 110 001 111. Determine the decoded original 3-bit message and identify any bit errors detected and corrected.
- 1.Step 1: Group the received stream into distinct triplets: Triplet 1 = '110', Triplet 2 = '001', Triplet 3 = '111'.
- 2.Step 2: Apply majority logic to Triplet 1 ('110'). Two 1s and one 0 results in a majority value of 1. A single-bit error in the third bit has been corrected.
- 3.Step 3: Apply majority logic to Triplet 2 ('001'). Two 0s and one 1 results in a majority value of 0. A single-bit error in the third bit has been corrected.
- 4.Step 4: Apply majority logic to Triplet 3 ('111'). Three 1s results in a majority value of 1. No bit error occurred in this triplet.
- 5.Step 5: Concatenate the majority bits to produce the final 3-bit decoded value: 101.