Explore the internal mechanics of Quick Response (QR) codes. Understand 2D matrix encoding, finder patterns, alignment grids, and Reed-Solomon fault tolerance.
Calculate your numbers instantly in your browser. Fast, free, no signup.
Invented in 1994 by Masahiro Hara at the Japanese company Denso Wave, the Quick Response (QR) code was originally engineered to track automotive parts through high-speed manufacturing lines. Today, QR codes bridge the physical and digital worlds, powering contactless payments, restaurant menus, Wi-Fi onboarding, and mobile authentication.
Unlike traditional 1-dimensional barcodes (UPC/EAN) which store data only horizontally, QR codes encode information both horizontally and vertically across a 2-dimensional grid.
Every QR code consists of specialized functional patterns and a data payload:
One of the most powerful architectural features of QR codes is their ability to be scanned even when partially obscured, scratched, or torn. This is made possible through Reed-Solomon Error Correction, a Galois field polynomial coding system.
QR codes support four selectable error correction levels:
| Level | Error Correction Capacity | Best Use Case | | :--- | :--- | :--- | | L (Low) | ~7% of data bytes can be restored | High-density clean digital screens | | M (Medium) | ~15% of data bytes can be restored | Standard print documents (Default) | | Q (Quartile) | ~25% of data bytes can be restored | Industrial tags and rugged environments | | H (High) | ~30% of data bytes can be restored | Adding logos or artwork in center |
A maximum Version 40 QR code ($177 \times 177$ grid) can store up to:
Generate custom, high-resolution QR codes right now with our free in-browser QR Code Generator.