Back to Discover
Curiosity

How Does a QR Code Work?

A QR code stores data as a grid of black and white modules wrapped in finder patterns, timing strips, and Reed–Solomon error correction, letting a camera locate the code, sample each module, and reconstruct the message despite damage.

Before you enter

A complete interactive classroom, not just a preview.

Start when you are ready to enter this Stage's 9 scenes and explore, respond, and learn as you go.

9
Scenes
18 min
Estimated
Content language: en-US
Start this Stage
Sign-in may be required to play
What happens inside
  1. 01The Puzzle in the Squaresslide
    Question

    Present a real QR code and ask how a grid of black and white squares can hold a meaningful message.

    • QR codes look like random pixel grids
    • Phones decode them in under a second
    • They still work when partly scratched or dirty
  2. 02Encode the Guess: Bit Gridinteractive
    Prediction

    Let the learner type a short word and watch it become a tiny grid of black and white cells, before revealing what a real QR code does differently.

    • Type a short message
    • See each character turned into bits
    • Notice how fragile a plain bit grid is when cells are lost
  3. 03Anatomy of a Real QR Codeslide
    Evidence

    Point out the three finder patterns in the corners, the quiet zone, timing strips, and alignment pattern in a real QR code.

    • Three large square finder patterns anchor the corners
    • A quiet zone of white space surrounds the code
    • Timing strips of alternating modules connect the finders
  4. 04Scratch It: Damage Simulatorslide
    Evidence

    Cover up part of a QR code with a draggable black bar and watch which areas can be lost without breaking the scan.

    • Drag a finger across the code
    • Finder patterns and timing strips must remain visible
    • Data areas tolerate large damage thanks to error correction
  5. 05From Bits to Reed–Solomonslide
    Explanation

    Explain how the raw message plus Reed–Solomon parity bits are interleaved across the grid so damage can be repaired.

    • Raw bytes are turned into codewords
    • Reed–Solomon adds parity blocks
    • Codewords are spread across the grid, not stored in order
  6. 06Which Part Can You Lose?quiz
    Transfer

    Ask the learner to choose which region of a QR code can be the most safely obscured without making it unscannable.

    • Decide which region is most expendable
    • Apply the idea of redundant parity blocks
  7. 07Where QR Codes Breakslide
    Boundary

    Show the limits: when finder patterns are hidden, when contrast collapses, or when codes are too small or too curved.

    • Finder patterns cannot be lost
    • Color must contrast against the background
    • Very tight curves can fool the sampler
  8. 08Build Your Own Mini QR Codeslide
    Transfer

    Let the learner enter a URL, choose an error correction level, and see a simplified QR grid render with its finder patterns and data blocks.

    • Type a URL
    • Pick low, medium, or high error correction
    • See finder patterns and data modules appear
  9. 09Answer: How a QR Code Worksslide
    Resolution

    Tie the answer together: finder patterns locate and orient the grid, timing strips space the cells, format info selects the mode and mask, and Reed–Solomon parity lets phones recover the message from a damaged code.

    • Finder patterns locate and orient the code
    • Timing strips align the modules
    • Format info selects mode and mask
    • Reed–Solomon error correction recovers lost data
Discussion

Discussion threads for a Stage aren't available yet.

Where this leads
Explore more

More in Technology & Computing

See all