Level 1 QR Encode |
The Key Stages in Creating a QR Code
This is a step by step overview of the processes involved in creating a QR code containing a given series of characters.
For more information, select the title button for a given stage.
- An encoding mode is chosen to determine how the characters will be encoded.
- Binary data can contain 7-bit ASCII characters or unicode characters that are encoded as multibyte characters using the UTF-8 encoding.
- Numeric data takes the least space, followed by alphanumeric and then binary
- If the data can be encoded in more that one way, then the one that takes the least space is chosen
- An error level determines the number of bytes that can be corrupted, detected and correntec.
- The four error levels are high, quartile, medium and low.
- The high error level requires the most space followed by quartile, medium and then low.
- The error level is determined accoring to whether it is more important to be able to correct data or to keep the size of the QR code low.
- With the input data, the encoding and the error level, the number of data bytes can be calculated..
- The number of data bytes determines the minimum QR code version that can be used..
- The QR Code grid can then be set up with the number of module based on the verison
- The static elements of the QR code are the positioning patterns, the timing patterns and the spacing. These can be added to the grid.
- There are eight different mask patterns.
- Any of these mask patterns can be applied to the data to create a valid QR code.
- Certain mask patterns create a better result with fewer blocks of white and black data.
- The result when each pattern is applied is rated, and the mask with the lowest ranking is chosen and applied to the data.
- The format information consists of fifteen bits.
- Two bits are used for the error level and three for the mask pattern. The rest are error correction bits.
- A mask is applied to the bits and the resulting bits are added to the QR code.
- The information bits are placed near to the two left positioning pattern
- A copy of the fifteen bits is also added to the QR code.
Terminology
QR Code
A QR code (Quick Response Code) contains data that can be scanned in using a device which is able to capture and decode the information stored within the data.
Alphanumeric Encoding
Data made up entirely of the the numeric characters, upper case letter from 1-Z, space and the characters: $ % * + - , /
Binary or Byte Encoding
Data made up of byte size blocks. An ASCII-7 character can be represented by one byte and all other characters can be expressed using UTF-8 encoding in two or more bytes.
Bit
A binary value equal to 0 or 1 that is represented by a single black or white module in the QR code.
Character Count
The number of characters encoded in the QR Code with the exception of multibyte characters that counts each byte as a character.
Data Block
Variable bit blocks of data containing information relating to one of these:
- Encoding mode
- Character count
- Encoded data
- Padding
- Error Codes
Data Byte
8-bit blocks of data that store the encoded data and the error codes.
Error Level
The error level determines the extent to which the QR code can be corrupted or not correctly scanned and the data can still be corrected.
Encoding Mode
Determines how the data is encoded. The standard encoding modes are numeric, alphanumeric, binary and kanji. The value is stored in a 4-bit block.
Error Bits
Additional bits that are added to the data to enable error correction.
Galoid Field Arithmetic
Calculations performed on a finite number of elements. QR codes use GF arithmetic over 2 and 256 elements. Calculations use the XOR operation and polynomial division.
Indicator Blocks
Two blocks of data used to store the encoding mode and character count.
Information Bits
Fifteen bits of encoded data containing the error level value and the mask pattern number.
Mask
A pattern applied to the QR code to optimise on the distribution of the modules.
Modules
Modules are the smallest component of a QR code.
- Modules are typically square and either black or white.
- A black module represents the binary value 0.
- A white module represents the binary value 1.
Numeric Encoding
Data made up entirely of the characters 0, 1, 2, 3, 4, 5, 6, 7, 8 or 9.
Positioning Patterns
Patterns that help to establish the orientation when scanning the QR code.
Quiet Zone
Blank space that is added around the QR code to enable correct scanning.
Reed-Solomon Error Codes
Additional codes that are added to the data to enable error detection and correction of multiple errors.
Timing Pattens
Alternating black and white modules determine the QR code version. The pattern contains (4n + 1) modules for a version n QR code.
Components of a QR Code
A QR code consists of a number of static elements that help determine the orientation and size of a QR code when it is being scanned.
The rest of the QR code is used to store the data relating to the information that is encoded within it.
- This QR code structure is for a version 1 QR code.
- The information in the QR code relates to Hello World with Binary
encoding, Low error level
and mask pattern 0.
| 18 | 18 | 17 | 17 | |||||||||||||||||||
| 18 | 18 | 17 | 17 | |||||||||||||||||||
| 18 | 18 | 17 | 17 | |||||||||||||||||||
| 18 | 18 | 17 | 17 | |||||||||||||||||||
| 19 | 19 | 16 | 16 | |||||||||||||||||||
| 19 | 19 | 16 | 16 | |||||||||||||||||||
| 19 | 19 | 16 | 16 | |||||||||||||||||||
| 19 | 19 | 16 | 16 | |||||||||||||||||||
| 26 | 26 | 25 | 25 | 24 | 24 | 23 | 23 | 20 | 20 | 15 | 15 | 10 | 10 | 9 | 9 | 4 | 4 | 3 | 3 | |||
| 26 | 26 | 25 | 25 | 24 | 24 | 23 | 23 | 20 | 20 | 15 | 15 | 10 | 10 | 9 | 9 | 4 | 4 | 3 | 3 | |||
| 26 | 26 | 25 | 25 | 24 | 24 | 23 | 23 | 20 | 20 | 15 | 15 | 10 | 10 | 9 | 9 | 4 | 4 | 3 | 3 | |||
| 26 | 26 | 25 | 25 | 24 | 24 | 23 | 23 | 20 | 20 | 15 | 15 | 10 | 10 | 9 | 9 | 4 | 4 | 3 | 3 | |||
| 21 | 21 | 14 | 14 | 11 | 11 | 8 | 8 | 5 | 5 | 2 | 2 | |||||||||||
| 21 | 21 | 14 | 14 | 11 | 11 | 8 | 8 | 5 | 5 | 2 | 2 | |||||||||||
| 21 | 21 | 14 | 14 | 11 | 11 | 8 | 8 | 5 | 5 | 2 | 2 | |||||||||||
| 21 | 21 | 14 | 14 | 11 | 11 | 8 | 8 | 5 | 5 | 2 | 2 | |||||||||||
| 22 | 22 | 13 | 13 | 12 | 12 | 7 | 7 | 6 | 6 | 1 | 1 | |||||||||||
| 22 | 22 | 13 | 13 | 12 | 12 | 7 | 7 | 6 | 6 | 1 | 1 | |||||||||||
| 22 | 22 | 13 | 13 | 12 | 12 | 7 | 7 | 6 | 6 | 1 | 1 | |||||||||||
| 22 | 22 | 13 | 13 | 12 | 12 | 7 | 7 | 6 | 6 | 1 | 1 | |||||||||||
| |
Positioning PatternsThree patterns to help establish the orientation when scanning the QR code. |
| |
InformationEncoded data containing the error level value and the mask pattern number. |
| |
Timing PatternsThe five modules indicate that this is a version 1 QR code. |
|
Data BytesThe encoded data and the error correction codes. The numbers show the order that the bytes of data are positioned in the QR code. |
SpaceSpace added between the positioning patterns and the rest of the QR code. |
Quiet ZoneBlank space that is added around the QR code to enable correct scanning. |
Fixed ModuleA module that is not used and has been defined to always be black. |
Data Position in the QR Code
A version 1 QR code allows for 208 bits of data. This data is entered into the data area of the QR code
- The first bit is placed in the bottom right of the QR code.
- The last bit is placed on the far right just above the bottom left positioning pattern.
- The data goes up and down in a two module width columns, as shown below.
- If the data sequence reaches a point where it cannot continue, it jumps to the bottom right of the unused data space.
Table showing how data is positioned within the QR code
↘ | ← | ← | ← | ||||||||||||||||||||||||
↘ | ← | ↗ | ← | ||||||||||||||||||||||||
↘ | ← | ↗ | ← | ||||||||||||||||||||||||
↘ | ← | ↗ | ← | ||||||||||||||||||||||||
↘ | ← | ↗ | ← | ||||||||||||||||||||||||
↙ | ← | ↗ | ← | ||||||||||||||||||||||||
↘ | ← | ↗ | ← | ||||||||||||||||||||||||
↘ | ← | ↗ | ← | ||||||||||||||||||||||||
↘ | ← | ← | ← | ↘ | ← | ← | ← |
↘ | ← | ↗ | ← | ↘ | ← | ← | ← | ↘ | ← | ← | ← |
||||||||
↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← |
||||||||
↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← |
||||||||
• | ← | ↗ | ← | ← | ← | ↗ | ← |
↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← |
||||||||
↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← |
||||||||||||||||
↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← |
||||||||||||||||
↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← |
||||||||||||||||
↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← |
||||||||||||||||
↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← |
||||||||||||||||
↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← |
||||||||||||||||
↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← | ↘ | ← | ↗ | ← |
||||||||||||||||
• | ← | ↗ | ← | ← | ← | ↗ | ← | ← | ← | ↗ | ← |
||||||||||||||||
|
|||||||||||||||||||||||||||
Data bits
The encoded data is then made up of:
- The mode indicator for the encoding (4 bits)
- The character count indicator block (The number of bits used depends on the encoding and the QR version)
- The encoded data blocks
- Padding data to complete any unused bytes.
- Error Codes
QR Code Encoding
Examples and encoding tool
Encoding describes the method by which the characters are converted into bits of data that can be store in the QR code
- There are four standard encoding modes used by QR codes: numeric, alphanumeric, binary and kanji.
- This tool demonstrates numeric, alphanumeric and binary encoding.
- All characters can be encoded using binary encoding although this may not be the most efficient selection.
- The selected encoding is stored as a 4-bit mode indicator at the beginning of the data.
Table of encoding types for a QR code
| Encoding | Description | 4-bit Mode Indicator |
|---|---|---|
| Numeric | Numeric characters: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 | 0001 |
| Alphanumeric | Uppercase letters, numeric characters, space or one of the characters $ % * + - , / | 0010 |
| Binary | Any character. | 0100 |
| Kanji | Kanji characters | 1000 |
Numeric Encoding
Numeric encoding can be used if the data is made up entirely of the characters 0, 1, 2, 3, 4, 5, 6, 7, 8 or 9
To encode the numeric characters:
- The digits are placed into groups of three from left to right to create values between 0 and 999.
- The 3-digit values are coverted to 10-bit binary numbers.
- If there is one remaining digit, it is multiplied by 16 and converted to an 8-bit binary number
- If there are two remaining digits, 2-digit value is multiplied by 2. The result is converted to an 8-bit binary number
Alphanumeric Encoding
Alphanumeric encoding can be used if the data is made up entirely of the following:
- Numeric digits
- Upper case letters
- Space
- The characters $ % * + - , / .
| ASCII value | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
|---|---|---|---|---|---|---|---|---|---|
| Character | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| ASCII value | 9 | A | B | C | D | E | F | G | H |
| Character | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 |
| ASCII value | I | J | K | L | M | N | O | P | Q |
| Character | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 |
| ASCII value | R | S | T | U | V | W | X | Y | Z |
| Character | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 |
| ASCII value | $ | % | * | + | - | . | / | : | |
| Character | 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | 44 |
To encode the alphanumeric characters:
- Look up the value of each alphanumeric character.
- The values are taken in pairs.
- The first value of each pair is multiplied by 45 and added to the second value to form a value between 1 and 2024.
- This value is then converted to an 11-bit binary number.
- If there is one remaining character, its value is multiplied by 4 and converted to an 8-bit binary number.
Binary Encoding
Binary encoding can be used for any character that has a unicode value and is stored using one of more bytes using UTF-8 encoding.
For values between 0 and 127, one byte of data is used and the character is encoded using it's ASCII value.
| ASCII value | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | 44 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Character | ! | " | # | $ | % | & | ' | ( | ) | * | + | , |
| ASCII value | 45 | 46 | 47 | 48 | 49 | 50 | 51 | 52 | 53 | 54 | 55 | 56 |
| Character | - | . | / | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| ASCII value | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | 68 |
| Character | 9 | : | ; | < | = | > | ? | @ | A | B | C | D |
| ASCII value | 69 | 70 | 71 | 72 | 73 | 74 | 75 | 76 | 77 | 78 | 79 | 80 |
| Character | E | F | G | H | I | J | K | L | M | N | O | P |
| ASCII value | 81 | 82 | 83 | 84 | 85 | 86 | 87 | 88 | 89 | 90 | 91 | 92 |
| Character | Q | R | S | T | U | V | W | X | Y | Z | [ | \ |
| ASCII value | 93 | 94 | 95 | 96 | 97 | 98 | 99 | 100 | 101 | 102 | 103 | 104 |
| Character | ] | ^ | _ | ` | a | b | c | d | e | f | g | h |
| ASCII value | 105 | 106 | 107 | 108 | 109 | 110 | 111 | 112 | 113 | 114 | 115 | 116 |
| Character | i | j | k | l | m | n | o | p | q | r | s | t |
| ASCII value | 117 | 118 | 119 | 120 | 121 | 122 | 123 | 124 | 125 | 126 | 127 | 128 |
| Character | u | v | w | x | y | z | { | | | } | ~ | DEL | |
| ASCII value | 33 | 34 | 35 | 36 | 37 | 38 | ||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Character | ! | " | # | $ | % | & | ||||||
| ASCII value | 39 | 40 | 41 | 42 | 43 | 44 | ||||||
| Character | ' | ( | ) | * | + | , | ||||||
| ASCII value | 45 | 46 | 47 | 48 | 49 | 50 | ||||||
| Character | - | . | / | 0 | 1 | 2 | ||||||
| ASCII value | 51 | 52 | 53 | 54 | 55 | 56 | ||||||
| Character | 3 | 4 | 5 | 6 | 7 | 8 | ||||||
| ASCII value | 57 | 58 | 59 | 60 | 61 | 62 | ||||||
| Character | 9 | : | ; | < | = | > | ||||||
| ASCII value | 63 | 64 | 65 | 66 | 67 | 68 | ||||||
| Character | ? | @ | A | B | C | D | ||||||
| ASCII value | 69 | 70 | 71 | 72 | 73 | 74 | ||||||
| Character | E | F | G | H | I | J | ||||||
| ASCII value | 75 | 76 | 77 | 78 | 79 | 80 | ||||||
| Character | K | L | M | N | O | P | ||||||
| ASCII value | 81 | 82 | 83 | 84 | 85 | 86 | ||||||
| Character | Q | R | S | T | U | V | ||||||
| ASCII value | 87 | 88 | 89 | 90 | 91 | 92 | ||||||
| Character | W | X | Y | Z | [ | \ | ||||||
| ASCII value | 93 | 94 | 95 | 96 | 97 | 98 | ||||||
| Character | ] | ^ | _ | ` | a | b | ||||||
| ASCII value | 99 | 100 | 101 | 102 | 103 | 104 | ||||||
| Character | c | d | e | f | g | h | ||||||
| ASCII value | 105 | 106 | 107 | 108 | 109 | 110 | ||||||
| Character | i | j | k | l | m | n | ||||||
| ASCII value | 111 | 112 | 113 | 114 | 115 | 116 | ||||||
| Character | o | p | q | r | s | t | ||||||
| ASCII value | 117 | 118 | 119 | 120 | 121 | 122 | ||||||
| Character | u | v | w | x | y | z | ||||||
| ASCII value | 123 | 124 | 125 | 126 | 127 | 128 | ||||||
| Character | { | | | } | ~ | DEL | | ||||||
Multi-Byte Characters
For character with unicode values greater than 127, UTF-8 encoding is used and each character is encoded using two or more bytes of data.
The table below shows examples of such characters and the UTF-8 encoded byte values store in the QR code
| Character | Unicode Value | UTF-8 Encoding |
|---|---|---|
| ½ | 189 | 194 189 |
| × | 215 | 195 151 |
| π | 960 | 207 128 |
| € | 8364 | 226 130 172 |
| ⇨ | 8680 | 226 135 168 |
| ☺ | 9786 | 226 152 186 |
| ⚅ | 9861 | 226 154 133 |
| 🐼 | 128060 | 240 159 144 188 |
| 😀 | 128512 | 240 159 152 128 |
| 🦋 | 129419 | 240 159 166 139 |
Error Levels
QR codes may be corrupted through incorrect formatting, damage or issues with scanning. The error level determines the percentage of the data that can be corrupted and then corrected in the QR Code data.
- There are four error levels: High, Quartile, Medium and Low.
- The error level value is stored in the first two digits of the information string.
- High error levels are able to correct more data errors but require more data bytes to be used for error correction codes.
- Low error levels requires fewer data bytes to be used as error codes but correct fewer errors.
Error Levels for a Version 1 QR Code
The table below gives information relating to the maximum number of characters that can be encoded for a particular error level and the maximum percentage of the data that can be corrected for a Version 1 QR code.
| Error Level | Maximum Characters | Percentage | Information Bits | ||||
|---|---|---|---|---|---|---|---|
| Numeric | Alphanumeric | Binary | |||||
| High | 17 | 10 | 7 | 30% |
|
||
| Quartile | 27 | 16 | 11 | 25% |
|
||
| Medium | 34 | 20 | 14 | 15% |
|
||
| Low | 41 | 25 | 17 | 7% |
|
||
| Error Level | Maximum Characters | ||
|---|---|---|---|
| Numeric | Alpha-numeric | Binary | |
| High | 17 | 10 | 7 |
| Quartile | 27 | 16 | 11 |
| Medium | 34 | 20 | 14 |
| Low | 41 | 25 | 17 |
Padding Blocks
The number of bytes allocated to the encoded data depends on the error level. If the space used to store the indicator modes and the encoded characters is less that the that available, extra padding blocks are added to to fill up the data.
- The first padding block is made up of four 0 bits and is always included to indicate the end of the data blocks..
- Additional padding blocks standardly use the byte values 0xEC and 0x11, alternating, until less than eight bits of data are left.
- Any final padding block with less that eight bits can take a value of 0
Example: "Version 1" encoded using binary mode
- A version 1 QR code has capacity for 26 bytes.
- The indicator data and extra 0 bits take up two bytes.
- Binary encoded "Version 1" takes up nine bytes (One byte per character).
- This leaves fifteen bytes for the error codes and the padding bytes
| Error Level | Number of bytes | Padding bytes | ||
|---|---|---|---|---|
| Error codes | Padding | Hexadecimal | Binary | |
| High | 17 | Unavailable option: Not enough bytes to encode the data | ||
| Quartile | 13 | 2 | 0xEC 0x11 | 11101100 00010001 |
| Medium | 10 | 5 | 0xEC 0x11 0xEC 0x11 0xEC | |
| Low | 7 | 8 | 0xEC 0x11 0xEC 0x11 0xEC 0x11 0xEC 0x11 | |
| Error Level | Padding bytes |
|---|---|
| High | Unavailable option: Not enough bytes to encode the data |
| Quartile | 0xEC 0x11 |
| Medium | 0xEC 0x11 0xEC 0x11 0xEC |
| Low | 0xEC 0x11 0xEC 0x11 0xEC 0x11 0xEC 0x11 |
Error Codes
Reed-Solomon error correction codes are added to the data to allow for a level of error detection and correction,
- The error level determines the number of error correction codes that can be created.
- The current data is split into byte size values, and these are used to generate the error codes
- If the data is corrupted, an algorithm is run on all of the bytes to determinine where the errors occured and how to correct it
- The error level determines at what point there is too much corruption of the data for the damage to be repaired
| Error Level | Data Bytes | Error Codes | Total bytes |
|---|---|---|---|
| High | 9 | 17 | 26 |
| Quartile | 13 | 13 | 26 |
| Medium | 16 | 10 | 26 |
| Low | 19 | 7 | 26 |
Generating the Reed-Solomon Error Codes
Generating the Reed-Soloman error codes from the existing data requires the maths of Galois Fields and Polynomial Division.
- The data is split into k bytes
- If the capacity of the QR code is n bytes, then n-k bytes are used as error codes
- The data bytes are used as the coefficients of a polynomial or order k
- The polynomial is then multiplied by xn-k and divided by a given generator polynomial using Galois Field multiplication over eight elements.
- The coefficients of the remainder are used as the error codes
The "Error Codes"/"Calculation" tab shows the full calculation for any data input when a QR code is generated.
Masking
Mask rating tool
A mask is applied to the data area of the QR Code to optimise the ability for a scanner to read it.
- There are eight different mask patterns.
- All eight masks produce valid QR codes that can be scanned in.
- QR code generation tools select the one with the lowest penalty as that is considered visibly the best.
- The best masks optimise the distribution of black and white modules.
Mask Patterns
The list of mask patterns show the conditional statement and the result of applying it to a 24 by 24 area of white modules
Mask Pattern 0
(row + col) % 2 == 0
Mask Pattern 1
row % 2 == 0
Mask Pattern 2
col % 3 == 0
Mask Pattern 3
(row + col) % 3 == 0
Mask Pattern 4
floor(row/2) + floor(col/3)) % 2 == 0
Mask Pattern 5
(row * col) % 2 + (row * col) % 3 == 0
Mask Pattern 6
((row * col) % 2 + (row * col) % 3) % 2 == 0
Mask Pattern 7
((row * col) % 3 + row + col) % 2 == 0
Rating Masks
To determine which is the best mask to use for a QR code, each mask is applied and then rated using a penalty point system.
- The mask with the lowest penalty points is chosen by default.
- Any mask value can be chosen although it may not be visibly the best.
Penalty Points
Penalty points are determined using the following factors
Calculation 1: Horizontal and vertical runs of five or more modules of the same colour
Each run of five or more modules of the same colour has a penalty of 3 points plus 1 for each additional pixel
Calculation 2: Block of the same colour greater than two by two modules.
Each two by two block of the same colour has a penalty of 3 points.
Calculation 3: Hoizontal and vertical runs matching the value "10111010000".
Each run matching the following has a penalty of 40 points.
Calculation 4: The ratio of black to white modules
Penalty calculated from the percentage of black modules. Ten penality points for each multiple of 5% from 50%
Format Information
The format information is a 15-bit sequence containing the error level and mask pattern.
- The essential information is made up of five bits.
- The first two bits represent the error level.
- The next three bits represent the mask pattern.
| Error Level | bits | ||
|---|---|---|---|
| High |
|
||
| Quartile |
|
||
| Medium |
|
||
| Low |
|
| Mask | bits | |||
|---|---|---|---|---|
| 0 |
|
|||
| 1 |
|
|||
| 2 |
|
|||
| 3 |
|
| Mask | bits | |||
|---|---|---|---|---|
| 4 |
|
|||
| 5 |
|
|||
| 6 |
|
|||
| 7 |
|
- Ten further bits are used for error correction, resulting in a 15-bit sequence.
- Up to three bit errors can be detected and corrected.
- The information bits are encoded by performing a bitwise XOR operation with the binary value 101010000010010 (21522)
- The encoded information bit modules are placed around the spacing modules in the top left corner of the QR Code
- They are also duplicated and placed to the other spacing modules in the bottom left and top right corners
- Duplication provides a further layer of error correction
Example: Low Error Level and Mask Pattern 0
| Initial Data |
|
||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Adding Error Bits |
|
||||||||||||||||||||||||||||||
| Unencoded Information Bits |
|
||||||||||||||||||||||||||||||
| Encoded Information Bits |
|
Mapping for each Error Level and Mask Combination
Error Level: 0 (Medium), Mask Pattern: 0
Information Bits: 00000
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
Encoded Information Bits
| 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 |
Error Level: 0 (Medium), Mask Pattern: 1
Information Bits: 00001
| 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 |
Encoded Information Bits
| 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 |
Error Level: 0 (Medium), Mask Pattern: 2
Information Bits: 00010
| 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 |
Encoded Information Bits
| 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 |
Error Level: 0 (Medium), Mask Pattern: 3
Information Bits: 00011
| 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 |
Encoded Information Bits
| 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 |
Error Level: 0 (Medium), Mask Pattern: 4
Information Bits: 00100
| 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 |
Encoded Information Bits
| 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 |
Error Level: 0 (Medium), Mask Pattern: 5
Information Bits: 00101
| 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 |
Encoded Information Bits
| 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 |
Error Level: 0 (Medium), Mask Pattern: 6
Information Bits: 00110
| 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 |
Encoded Information Bits
| 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 |
Error Level: 0 (Medium), Mask Pattern: 7
Information Bits: 00111
| 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 |
Encoded Information Bits
| 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
Error Level: 1 (Low), Mask Pattern: 0
Information Bits: 01000
| 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 |
Encoded Information Bits
| 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 |
Error Level: 1 (Low), Mask Pattern: 1
Information Bits: 01001
| 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 |
Encoded Information Bits
| 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 |
Error Level: 1 (Low), Mask Pattern: 2
Information Bits: 01010
| 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 |
Encoded Information Bits
| 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 |
Error Level: 1 (Low), Mask Pattern: 3
Information Bits: 01011
| 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 |
Encoded Information Bits
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 |
Error Level: 1 (Low), Mask Pattern: 4
Information Bits: 01100
| 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 |
Encoded Information Bits
| 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
Error Level: 1 (Low), Mask Pattern: 5
Information Bits: 01101
| 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 |
Encoded Information Bits
| 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 |
Error Level: 1 (Low), Mask Pattern: 6
Information Bits: 01110
| 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 |
Encoded Information Bits
| 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
Error Level: 1 (Low), Mask Pattern: 7
Information Bits: 01111
| 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 |
Encoded Information Bits
| 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 |
Error Level: 2 (High), Mask Pattern: 0
Information Bits: 10000
| 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 |
Encoded Information Bits
| 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 |
Error Level: 2 (High), Mask Pattern: 1
Information Bits: 10001
| 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 |
Encoded Information Bits
| 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
Error Level: 2 (High), Mask Pattern: 2
Information Bits: 10010
| 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 |
Encoded Information Bits
| 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 |
Error Level: 2 (High), Mask Pattern: 3
Information Bits: 10011
| 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 |
Encoded Information Bits
| 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 |
Error Level: 2 (High), Mask Pattern: 4
Information Bits: 10100
| 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 |
Encoded Information Bits
| 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 |
Error Level: 2 (High), Mask Pattern: 5
Information Bits: 10101
| 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 |
Encoded Information Bits
| 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 |
Error Level: 2 (High), Mask Pattern: 6
Information Bits: 10110
| 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 |
Encoded Information Bits
| 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 |
Error Level: 2 (High), Mask Pattern: 7
Information Bits: 10111
| 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 |
Encoded Information Bits
| 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 |
Error Level: 3 (Quartile), Mask Pattern: 0
Information Bits: 11000
| 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 |
Encoded Information Bits
| 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
Error Level: 3 (Quartile), Mask Pattern: 1
Information Bits: 11001
| 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 |
Encoded Information Bits
| 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 |
Error Level: 3 (Quartile), Mask Pattern: 2
Information Bits: 11010
| 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 |
Encoded Information Bits
| 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 |
Error Level: 3 (Quartile), Mask Pattern: 3
Information Bits: 11011
| 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 |
Encoded Information Bits
| 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 |
Error Level: 3 (Quartile), Mask Pattern: 4
Information Bits: 11100
| 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 |
Encoded Information Bits
| 0 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 |
Error Level: 3 (Quartile), Mask Pattern: 5
Information Bits: 11101
| 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 |
Encoded Information Bits
| 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 |
Error Level: 3 (Quartile), Mask Pattern: 6
Information Bits: 11110
| 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 |
Encoded Information Bits
| 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 |
Error Level: 3 (Quartile), Mask Pattern: 7
Information Bits: 11111
| 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
Encoded Information Bits
| 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 |
