ELEC1010 Chap.10 Error Detection and Reliable Codes
Error Detection and Reliable Codes
Add redundancy so corruption becomes visible
Channel coding adds structured redundancy so not every possible received word is valid. The unused patterns create space around permitted messages: corruption can move a transmitted codeword outside the valid set and become detectable.
Reliability improves because extra structure is checked, while efficiency falls because some transmitted bits carry protection rather than new payload information.
Even parity selects one check bit so the complete codeword contains an even number of ones. Count the payload ones, choose the appended bit, and then recount the entire word.
The position of the parity bit may be left or right if sender and receiver agree, but the rule always applies to data and check bit together rather than to the payload alone.
A single bit flip changes the parity of the complete word and is always detected by one even-parity check. Three flips also change parity. Two flips, or another even number, may preserve the even count and pass despite corruption.
State the detectable error pattern instead of making the broader claim that parity detects every transmission error.
A failed check proves that the received word violates the selected parity rule. It does not identify the changed position and does not reconstruct the original message. Detection, location and correction are different capabilities.
Stronger codes use more structured checks so several consistency results can narrow or correct error patterns, but a single parity bit supplies only one binary consistency test.
Shorter protected blocks add more check bits for a fixed payload, lowering code rate, yet reduce the region in which flips can cancel one another.
One long parity group has less overhead but allows any even number of flips across the full group to escape. Compare block choices by naming both the efficiency cost and the resulting undetected-error structure.
Revision should alternate encoding and checking. Create complete words under even and odd parity, inject one-flip and two-flip patterns, and explain every receiver verdict.
Calculate payload bits divided by total transmitted bits to make redundancy explicit. End each answer with the exact capability demonstrated: the word is valid or invalid under the rule, but passing is not proof that no error occurred.
What this chapter covers
- 01
Bit-error significance
- 02
Channel redundancy
- 03
Even and odd parity
- 04
Valid codeword sets
- 05
Undetected even flips
- 06
Block-size trade-offs
Worked example · free
Add and test even parity
- 2Count ones in the data word.
- 2Choose and append the check bit.
- 4Count the received word and state the limit.
Key terms
- Bit Error
- A stored or transmitted zero changed to one, or one changed to zero.
- Channel Coding
- The addition of structured redundancy to improve reliability.
- Codeword
- A complete valid encoded bit pattern.
- Parity Bit
- A check bit selected to enforce an even or odd one count.
- Code Rate
- The ratio of payload bits to total transmitted bits.
Error Detection and Reliable Codes FAQ
What does a failed parity check prove?
It proves that an odd-number error pattern affected the complete word under the stated parity rule. It does not reveal which bit changed or supply the corrected message.
Can even parity miss an error?
Yes. Two or another even number of bit flips can preserve an even count of ones, allowing a corrupted word to pass the single parity check.
Why use shorter protected blocks?
More checks reduce efficiency but make it less likely that several flips cancel within one protected group. The useful block size depends on error probability and overhead constraints.
Does a passing parity check prove the word is correct?
No. A passing result proves only that the received word satisfies the parity rule. An even number of bit flips can preserve the count and remain undetected.
Exam move
Encode and check words in alternating exercises. Count ones, append the required bit, recount the complete word and state exactly which error patterns are detected. Compare one long parity block with several short blocks, then explain the cost through code rate. Keep detection separate from location and correction. Audit reliability without overclaiming it.
Show the original parity count, received count and receiver verdict, then classify the injected pattern by its number of flips. An odd count must fail a single parity check, while an even count may pass, directly disproving universal detection. State whether the method locates or corrects the error; ordinary parity does neither. Finally compute code rate to expose the protection cost.
Each reliability statement should remain tied to a specific code structure and error pattern rather than treating redundancy as a guarantee that all corruption is recoverable.
Working through Error Detection and Reliable Codes in ELEC1010? Sia is AskSia’s AI Electrical Engineering tutor — ask any ELEC1010 Error Detection and Reliable Codes question and get a clear, step-by-step explanation grounded in how ELEC1010 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.