Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Data Matrix
open-in-new
<h2 id="applications">Applications</h2> <p>The most popular application for Data Matrix is marking small items, due to the code's ability to encode fifty characters in a symbol that is readable at 2 or 3 mm2 (0.003 or 0.005 sq in) and the fact that the code can be read with only a 20% contrast ratio.<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a> A Data Matrix is scalable; commercial applications exist with images as small as 300 micrometres (0.012 in) (laser etched on a 600-micrometre (0.024 in) silicon device) and as large as a 1 metre (3 ft) square (painted on the roof of a <a href="/facts/Boxcar/op83mC34">boxcar</a>). Fidelity of the marking and reading systems are the only limitation. The US <a href="/facts/Electronic_Industries_Alliance/CIxRjt05">Electronic Industries Alliance</a> (EIA) recommends using Data Matrix for labeling small electronic components.<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> </p><p>Data Matrix codes are becoming common on printed media such as labels and letters. The code can be read quickly by a <a href="/facts/Barcode_reader/k6L6FUlY">barcode reader</a> which allows the media to be tracked, for example when a parcel has been dispatched to the recipient. </p> <p>For industrial engineering purposes, Data Matrix codes can be marked directly onto components, ensuring that only the intended component is identified with the data-matrix-encoded data. The codes can be marked onto components with various methods, but within the aerospace industry these are commonly industrial ink-jet, dot-peen marking, laser marking, and electrolytic chemical etching (ECE). These methods give a permanent mark which can last up to the lifetime of the component. </p><p>Data Matrix codes are usually verified using specialist camera equipment and software. This verification ensures the code conforms to the relevant standards, and ensures readability for the lifetime of the component. After component enters service, the Data Matrix code can then be read by a reader camera, which decodes the Data Matrix data which can then be used for a number of purposes, such as movement tracking or inventory stock checks. </p> <p>Data Matrix codes, along with other open-source codes such as 1D barcodes can also be read with mobile phones by downloading code specific mobile applications. Although many mobile devices are able to read 2D codes including Data Matrix Code,<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> few extend the decoding to enable mobile access and interaction, whereupon the codes can be used securely and across media; for example, in track and trace, anti-counterfeit, e.govt, and banking solutions. </p> <h3>Food industry</h3> <p>Data Matrix codes are used in the <a href="/facts/Food_industry/1JPhss6V">food industry</a> in <a href="/facts/Autocoding/oe9eW2Af">autocoding</a> systems to prevent food products being packaged and dated incorrectly. Codes are maintained internally on a food manufacturers database and associated with each unique product, e.g. ingredient variations. For each product run the unique code is supplied to the printer. Label artwork is required to allow the 2D Data Matrix to be positioned for optimal scanning. For black on white codes testing isn't required unless print quality is an issue, but all color variations need to be tested before production to ensure they are readable. </p> <h3>Art</h3> <p>In May 2006 a German computer programmer, Bernd Hopfengärtner, created a large Data Matrix in a wheat field (in a fashion similar to <a href="/facts/Crop_circle/AxVIpLn8">crop circles</a>). The message read "<a href="/facts/Hello%2c_World!/vLn0jLlL">Hello, World!</a>".<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> </p> <h2 id="technical-specifications">Technical specifications</h2> <p>Data Matrix symbols are made up of modules arranged within a perimeter finder and timing pattern. It can encode up to 3,116 characters from the entire <a href="/facts/ASCII/vGUI33Qu">ASCII</a> character set (with extensions). The symbol consists of data regions which contain modules set out in a regular array. Large symbols contain several regions. Each data region is delimited by a finder pattern, and this is surrounded on all four sides by a quiet zone border (margin). (Note: The modules may be round or square- no specific shape is defined in the standard. For example, dot-peened cells are generally round.) </p> <h3>Data Matrix ECC 200</h3> <p>ECC 200, the newer version of Data Matrix, uses <a href="/facts/Reed%25E2%2580%2593Solomon_error_correction/HPc3Qj6N">Reed–Solomon</a> codes for error and erasure recovery. ECC 200 allows the routine reconstruction of the entire encoded data string when the symbol has sustained 30% damage, assuming the matrix can still be accurately located. Data Matrix has an error rate of less than 1 in 10 million characters scanned.<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> </p><p>Symbols have an even number of rows and an even number of columns. Most of the symbols are square with sizes from 10 × 10 to 144 × 144. Some symbols however are rectangular with sizes from 8×18 to 16×48 (even values only). All symbols using the ECC 200 error correction can be recognized by the upper-right corner module being the same as the background color. (binary 0). </p><p>Additional capabilities that differentiate ECC 200 symbols from the earlier standards include: </p> <ul><li>Inverse reading symbols (light images on a dark background)</li> <li>Specification of the character set (via <a href="/facts/Extended_Channel_Interpretations/sdDz7MxD">Extended Channel Interpretations</a>)</li> <li>Rectangular symbols</li> <li>Structured append (linking of up to 16 symbols to encode larger amounts of data)</li></ul> <p><a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> </p> <h3>Data Matrix ECC 000–140</h3> <p>Older versions of Data Matrix include ECC 000, ECC 050, ECC 080, ECC 100, ECC 140. Instead of using <a href="/facts/Reed%25E2%2580%2593Solomon_error_correction/HPc3Qj6N">Reed–Solomon</a> codes like ECC 200, ECC 000–140 use a convolution-based error correction. Each varies in the amount of error correction it offers, with ECC 000 offering none, and ECC 140 offering the greatest. For error detection at decode time, even in the case of ECC 000, each of these versions also encode a <a href="/facts/Cyclic_redundancy_check/u2exo4sv">cyclic redundancy check</a> (CRC) on the bit pattern. As an added measure, the placement of each bit in the code is determined by bit-placement tables included in the specification. These older versions always have an odd number of modules, and can be made in sizes ranging from 9 × 9 to 49 × 49. All symbols utilizing the ECC 000 through 140 error correction can be recognized by the upper-right corner module being the inverse of the background color. (binary 1). </p><p>According to ISO/IEC 16022, "ECC 000–140 should only be used in closed applications where a single party controls both the production and reading of the symbols and is responsible for overall system performance." </p> <h3>Standards</h3> <p>Data Matrix was invented by International Data Matrix, Inc. (ID Matrix) which was merged into RVSI/<a href="/facts/Acuity_CiMatrix/bJRutzyo">Acuity CiMatrix</a>, who were acquired by <a href="/facts/Siemens/coa80TQn">Siemens</a> AG in October 2005 , Microscan Systems in September 2008, and Omron in 2017. Data Matrix is covered today by several <a href="/facts/International_Organization_for_Standardization/IacYR7Yg">ISO</a>/<a href="/facts/International_Electrotechnical_Commission/hSK0kjwI">IEC</a> standards and is in the public domain for many applications, which means it can be used free of any licensing or royalties. </p> <ul><li>ISO/IEC 16022:2006—Data Matrix bar code symbology specification</li> <li>ISO/IEC 15415—2-D Print quality standard</li> <li>ISO/IEC 15418:2016—Symbol data format semantics (<a href="/facts/GS1/MNX4N5ut">GS1</a> application identifiers and ASC MH10 data identifiers and maintenance)</li> <li>ISO/IEC 15424:2008—Data Carrier Identifiers (including Symbology Identifiers) [IDs for distinguishing different barcode types]</li> <li>ISO/IEC 15434:2006—Syntax for high-capacity ADC media (format of data transferred from scanner to software, etc.)</li> <li>ISO/IEC 15459—Unique identifiers</li></ul> <h3>Error correction</h3> <p>Data Matrix codes use <a href="/facts/Reed%25E2%2580%2593Solomon_error_correction/HPc3Qj6N">Reed–Solomon error correction</a> over the <a href="/facts/Finite_field/UkMGJo3m">finite field</a> F 256 {\displaystyle \mathbb {F} _{256}} (or GF(28)), the elements of which are encoded as <a href="/facts/Octet_(computing)/dqCHsuUF">bytes of 8 bits</a>; the byte b 7 b 6 b 5 b 4 b 3 b 2 b 1 b 0 {\displaystyle b_{7}b_{6}b_{5}b_{4}b_{3}b_{2}b_{1}b_{0}} with a standard numerical value ∑ i = 0 7 b i 2 i {\displaystyle \textstyle \sum _{i=0}^{7}b_{i}2^{i}} encodes the field element ∑ i = 0 7 b i α i {\displaystyle \textstyle \sum _{i=0}^{7}b_{i}\alpha ^{i}} where α ∈ F 256 {\displaystyle \alpha \in \mathbb {F} _{256}} is taken to be a primitive element satisfying α 8 + α 5 + α 3 + α 2 + 1 = 0 {\displaystyle \alpha ^{8}+\alpha ^{5}+\alpha ^{3}+\alpha ^{2}+1=0} . The primitive polynomial is x 8 + x 5 + x 3 + x 2 + 1 {\displaystyle x^{8}+x^{5}+x^{3}+x^{2}+1} , corresponding to the polynomial number 301, with initial root = 1 to obtain generator polynomials. The Reed–Solomon code uses different generator polynomials over F 256 {\displaystyle \mathbb {F} _{256}} , depending on how many error correction bytes the code adds. The number of bytes added is equal to the degree of the generator polynomial. </p><p>For example, in the 10 × 10 symbol, there are 3 data bytes and 5 error correction bytes. The generator polynomial is obtained as: g ( x ) = ( x + α ) ( x + α 2 ) ( x + α 3 ) ( x + α 4 ) ( x + α 5 ) {\displaystyle g(x)=(x+\alpha )(x+\alpha ^{2})(x+\alpha ^{3})(x+\alpha ^{4})(x+\alpha ^{5})} , </p><p>which gives: g ( x ) = x 5 + α 235 x 4 + α 207 x 3 + α 210 x 2 + α 244 x + α 15 {\displaystyle g(x)=x^{5}+\alpha ^{235}x^{4}+\alpha ^{207}x^{3}+\alpha ^{210}x^{2}+\alpha ^{244}x+\alpha ^{15}} , </p><p>or with decimal coefficients: g ( x ) = x 5 + 62 x 4 + 111 x 3 + 15 x 2 + 48 x + 228 {\displaystyle g(x)=x^{5}+62x^{4}+111x^{3}+15x^{2}+48x+228} . </p> <h3>Encoding</h3> <p>The encoding process is described in the <a href="/facts/ISO%2fIEC/hh9xdNtz">ISO/IEC</a> standard 16022:2006.<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a> Open-source software for encoding and decoding the ECC-200 variant of Data Matrix has been published.<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a><a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a> </p><p>The diagrams below illustrate the placement of the message data within a Data Matrix symbol. The message is "Wikipedia", and it is arranged in a somewhat complicated diagonal pattern starting near the upper-left corner. Some characters are split in two pieces, such as the initial W, and the third 'i' is in "corner pattern 2" rather than the usual L-shaped arrangement. Also shown are the end-of-message code (marked End), the padding (P) and error correction (E) bytes, and four modules of unused space (X). </p><p>The symbol is of size 16×16 (14×14 data area), with 12 data bytes (including 'End' and padding) and 12 error correction bytes. A (255,243,6) Reed Solomon code shortened to (24,12,6) is used. It can correct up to 6 byte errors or erasures. </p><p>To obtain the error correction bytes, the following procedure may be carried out: </p><p>The generator polynomial specified for the (24,12,6) code, is: g ( x ) = x 12 + 242 x 11 + 100 x 10 + 178 x 9 + 97 x 8 + 213 x 7 + 142 x 6 + 42 x 5 + 61 x 4 + 91 x 3 + 158 x 2 + 153 x + 41 {\displaystyle g(x)=x^{12}+242x^{11}+100x^{10}+178x^{9}+97x^{8}+213x^{7}+142x^{6}+42x^{5}+61x^{4}+91x^{3}+158x^{2}+153x+41} , which may also be written in the form of a matrix of decimal coefficients: </p> [1 242 100 178 97 213 142 42 61 91 158 153 41] <p>The 12-byte long message "Wikipedia" including 'End', P1 and P2, in decimal coefficients (see the diagrams below for the computation method using ASCII values), is: </p> [88 106 108 106 113 102 101 106 98 129 251 147] <p>Using the procedure for <a href="/facts/Reed%25E2%2580%2593Solomon_error_correction/HPc3Qj6N">Reed-Solomon systematic encoding</a>, the 12 error correction bytes obtained (E1 through E12 in decimal) in the form of the remainder after polynomial division are: </p> [104 216 88 39 233 202 71 217 26 92 25 232] <p>These error correction bytes are then appended to the original message. The resulting coded message has 24 bytes, and is in the form: </p> [W i k i p e d i a 'End' P1 P2 E1 E2 E3 E4 E5 E6 E7 E8 E9 E10 E11 E12] <p>or in decimal coefficients: </p> [88 106 108 106 113 102 101 106 98 129 251 147 104 216 88 39 233 202 71 217 26 92 25 232] <p>and in hexadecimal coefficients: </p> [58 6A 6C 6A 71 66 65 6A 62 81 FB 93 68 D8 58 27 E9 CA 47 D9 1A 5C 19 E8] <table><tbody><tr><td></td><td></td></tr></tbody></table> <p>Multiple encoding modes are used to store different kinds of messages. The default mode stores one <a href="/facts/ASCII/vGUI33Qu">ASCII</a> character per 8-bit codeword. Control codes are provided to switch between modes, as shown below. </p> <table><tbody><tr><th>Codeword</th><th>Codeword hexadecimal</th><th>Interpretation</th></tr><tr><td>0</td><td>0</td><td>Not used</td></tr><tr><td>1–128</td><td>1-80</td><td>ASCII data (ASCII value + 1)</td></tr><tr><td>129</td><td>81</td><td>End of message</td></tr><tr><td>130–229</td><td>82-e5</td><td>Digit pairs 00–99</td></tr><tr><td>230</td><td>e6</td><td>Begin C40 encoding</td></tr><tr><td>231</td><td>e7</td><td>Begin Base 256 encoding</td></tr><tr><td>232</td><td>e8</td><td>FNC1</td></tr><tr><td>233</td><td>e9</td><td>Structured append. Allows a message to be split across multiple symbols.</td></tr><tr><td>234</td><td>ea</td><td>Reader programming</td></tr><tr><td>235</td><td>eb</td><td>Set <a href="/facts/High_bit/94h4P3qr">high bit</a> of the following character</td></tr><tr><td>236</td><td>ec</td><td>05 Macro</td></tr><tr><td>237</td><td>ed</td><td>06 Macro</td></tr><tr><td>238</td><td>ee</td><td>Begin <a href="/facts/ANSI_X12/yVMzQ1zs">ANSI X12</a> encoding</td></tr><tr><td>239</td><td>ef</td><td>Begin Text encoding</td></tr><tr><td>240</td><td>f0</td><td>Begin <a href="/facts/EDIFACT/aHavD1mX">EDIFACT</a> encoding</td></tr><tr><td>241</td><td>f1</td><td><a href="/facts/Extended_Channel_Interpretation/sdDz7MxD">Extended Channel Interpretation</a> code</td></tr><tr><td>242–255</td><td>f2-ff</td><td>Not used</td></tr></tbody></table> <h3>Text modes</h3> <p>The C40, Text and <a href="/facts/ANSI_X12/yVMzQ1zs">X12</a> modes are potentially more compact for storing text messages. They are similar to <a href="/facts/DEC_Radix-50/YyAcueyS">DEC Radix-50</a>, using character codes in the range 0–39, and three of these codes are combined to make a number up to 403=64000, which is packed into two bytes (maximum value 65536) as follows: </p> V = C1×1600 + C2×40 + C3 + 1 B1 = floor(V/256) B2 = V mod 256 <p>The resulting value of B1 is in the range 0–250. The special value 254 is used to return to ASCII encoding mode. </p><p>Character code interpretations are shown in the table below. The C40 and Text modes have four separate sets. Set 0 is the default, and contains codes that temporarily select a different set for the next character. The only difference is that they reverse upper-and lower-case letters. C40 is primarily upper-case, with lower-case letters in set 3; Text is the other way around. Set 1, containing ASCII control codes, and set 2, containing punctuation symbols are identical in C40 and Text mode. </p> <table><tbody><tr><th rowspan="2">Code</th><th colspan="2">set 0</th><th rowspan="2">set 1</th><th rowspan="2">set 2</th><th colspan="2">set 3</th><th rowspan="2">X12</th></tr><tr><th>C40</th><th>Text</th><th>C40</th><th>Text</th></tr><tr><td>0</td><td colspan="2">set 1</td><td>NUL</td><td>!</td><td colspan="2">`</td><td>CR</td></tr><tr><td>1</td><td colspan="2">set 2</td><td>SOH</td><td>"</td><td>a</td><td>A</td><td>*</td></tr><tr><td>2</td><td colspan="2">set 3</td><td>STX</td><td>#</td><td>b</td><td>B</td><td>></td></tr><tr><td>3</td><td colspan="2">space</td><td>ETX</td><td>$</td><td>c</td><td>C</td><td>space</td></tr><tr><td>4</td><td colspan="2">0</td><td>EOT</td><td>%</td><td>d</td><td>D</td><td>0</td></tr><tr><td>5</td><td colspan="2">1</td><td>ENQ</td><td>&</td><td>e</td><td>E</td><td>1</td></tr><tr><td>6</td><td colspan="2">2</td><td>ACK</td><td>'</td><td>f</td><td>F</td><td>2</td></tr><tr><td>7</td><td colspan="2">3</td><td>BEL</td><td>(</td><td>g</td><td>G</td><td>3</td></tr><tr><td>8</td><td colspan="2">4</td><td>BS</td><td>)</td><td>h</td><td>H</td><td>4</td></tr><tr><td>9</td><td colspan="2">5</td><td>HT</td><td>*</td><td>i</td><td>I</td><td>5</td></tr><tr><td>10</td><td colspan="2">6</td><td>LF</td><td>+</td><td>j</td><td>J</td><td>6</td></tr><tr><td>11</td><td colspan="2">7</td><td>VT</td><td>,</td><td>k</td><td>K</td><td>7</td></tr><tr><td>12</td><td colspan="2">8</td><td>FF</td><td>–</td><td>l</td><td>L</td><td>8</td></tr><tr><td>13</td><td colspan="2">9</td><td>CR</td><td>.</td><td>m</td><td>M</td><td>9</td></tr><tr><td>14</td><td>A</td><td>a</td><td>SO</td><td>/</td><td>n</td><td>N</td><td>A</td></tr><tr><td>15</td><td>B</td><td>b</td><td>SI</td><td>:</td><td>o</td><td>O</td><td>B</td></tr><tr><td>16</td><td>C</td><td>c</td><td>DLE</td><td>;</td><td>p</td><td>P</td><td>C</td></tr><tr><td>17</td><td>D</td><td>d</td><td>DC1</td><td><</td><td>q</td><td>Q</td><td>D</td></tr><tr><td>18</td><td>E</td><td>e</td><td>DC2</td><td>=</td><td>r</td><td>R</td><td>E</td></tr><tr><td>19</td><td>F</td><td>f</td><td>DC3</td><td>></td><td>s</td><td>S</td><td>F</td></tr><tr><td>20</td><td>G</td><td>g</td><td>DC4</td><td>?</td><td>t</td><td>T</td><td>G</td></tr><tr><td>21</td><td>H</td><td>h</td><td>NAK</td><td>@</td><td>u</td><td>U</td><td>H</td></tr><tr><td>22</td><td>I</td><td>i</td><td>SYN</td><td>[</td><td>v</td><td>V</td><td>I</td></tr><tr><td>23</td><td>J</td><td>j</td><td>ETB</td><td>\</td><td>w</td><td>W</td><td>J</td></tr><tr><td>24</td><td>K</td><td>k</td><td>CAN</td><td>]</td><td>x</td><td>X</td><td>K</td></tr><tr><td>25</td><td>L</td><td>l</td><td>EM</td><td>^</td><td>y</td><td>Y</td><td>L</td></tr><tr><td>26</td><td>M</td><td>m</td><td>SUB</td><td>_</td><td>z</td><td>Z</td><td>M</td></tr><tr><td>27</td><td>N</td><td>n</td><td>ESC</td><td>FNC1</td><td colspan="2">{</td><td>N</td></tr><tr><td>28</td><td>O</td><td>o</td><td>FS</td><td rowspan="2"></td><td colspan="2">|</td><td>O</td></tr><tr><td>29</td><td>P</td><td>p</td><td>GS</td><td colspan="2">}</td><td>P</td></tr><tr><td>30</td><td>Q</td><td>q</td><td>RS</td><td>hibit</td><td colspan="2">~</td><td>Q</td></tr><tr><td>31</td><td>R</td><td>r</td><td>US</td><td rowspan="9"></td><td colspan="2">DEL</td><td>R</td></tr><tr><td>32</td><td>S</td><td>s</td><td rowspan="8"></td><td colspan="2" rowspan="8"></td><td>S</td></tr><tr><td>33</td><td>T</td><td>t</td><td>T</td></tr><tr><td>34</td><td>U</td><td>u</td><td>U</td></tr><tr><td>35</td><td>V</td><td>v</td><td>V</td></tr><tr><td>36</td><td>W</td><td>w</td><td>W</td></tr><tr><td>37</td><td>X</td><td>x</td><td>X</td></tr><tr><td>38</td><td>Y</td><td>y</td><td>Y</td></tr><tr><td>39</td><td>Z</td><td>z</td><td>Z</td></tr></tbody></table> <h3>EDIFACT mode</h3> <p><a href="/facts/EDIFACT/aHavD1mX">EDIFACT</a> mode uses six bits per character, with four characters packed into three bytes. It can store digits, upper-case letters, and many punctuation marks, but has no support for lower-case letters. </p> <table><tbody><tr><th>Code</th><th>Meaning</th></tr><tr><td>0–30</td><td>ASCII codes 64–94</td></tr><tr><td>31</td><td>Return to ASCII mode</td></tr><tr><td>32–63</td><td>ASCII codes 32–63</td></tr></tbody></table> <h3>Base 256 mode</h3> <p>Base 256 mode data starts with a length indicator, followed by a number of data bytes. A length of 1 to 249 is encoded as a single byte, and longer lengths are stored as two bytes. </p> L1 = floor(length / 250) + 249, L2 = length mod 250 <p>It is desirable to avoid long strings of zeros in the coded message, because they become large blank areas in the Data Matrix symbol, which may cause a scanner to lose synchronization. (The default ASCII encoding does not use zero for this reason.) In order to make that less likely, the length and data bytes are obscured by adding a pseudorandom value R(n), where n is the position in the byte stream. </p> R(n) = (149 × n) mod 255 + 1 <h2 id="patent-issues">Patent issues</h2> <p>Prior to the expiration of US patent 5,612,524<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a> in November 2007, intellectual property company <a href="/facts/Acacia_Research/yHHxvm12">Acacia Technologies</a> claimed that Data Matrix was partially covered by its contents. As the patent owner, Acacia allegedly contacted Data Matrix users demanding license fees related to the patent. </p><p><a href="/facts/Cognex_Corporation/2AWuqbj9">Cognex Corporation</a>, a large manufacturer of 2D barcode devices, filed a <a href="/facts/Declaratory_judgment/29Kp0ylj">declaratory judgment</a> complaint on 13 March 2006 after receiving information that Acacia had contacted its customers demanding licensing fees. On 19 May 2008 Judge Joan N. Ericksen of the U.S. District Court in Minnesota ruled in favor of Cognex.<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a> The ruling held that the '524 patent, which claimed to cover a system for capturing and reading 2D symbology codes, is both invalid and unenforceable due to <a href="/facts/Inequitable_conduct/YW78rNoc">inequitable conduct</a> by the defendants during the procurement of the patent. </p><p>While the ruling was delivered after the patent expired, it precluded claims for infringement based on use of Data Matrix prior to November 2007. </p><p>A German patent application DE 4107020 was filed in 1991, and published in 1992. This patent is not cited in the above US patent applications and might invalidate them. </p> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/PDF417/k4QzpTUm">PDF417</a></li> <li><a href="/facts/Aztec_Code/Euzhfuzz">Aztec Code</a></li> <li><a href="/facts/High_Capacity_Color_Barcode/QXG6G9nF">High Capacity Color Barcode</a></li> <li><a href="/facts/MaxiCode/6oMUhqTB">MaxiCode</a></li> <li><a href="/facts/Nintendo_e-Reader/YMTehQ6s">Nintendo e-Reader</a></li> <li><a href="/facts/QR_Code/B0l0IS7a">QR Code</a></li> <li><a href="/facts/Semacode/E3Yt7oUU">Semacode</a></li> <li><a href="/facts/SPARQCode/fpk1FsCU">SPARQCode</a></li> <li><a href="/facts/Trusted_paper_key/0Vc94Stq">Trusted paper key</a></li></ul> <h2 id="external-links">External links</h2> Wikimedia Commons has media related to DataMatrix. <ul><li><a href="http://www.gs1.org/docs/barcodes/GS1_DataMatrix_Guideline.pdf">GS1 DataMatrix Guideline: Overview and technical introduction to the use of GS1 DataMatrix</a></li> <li><a href="https://www.datamatrix-code-generator.com/">Datamatrix Code Generator - Online Tool</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>"Data Matrix Barcode". Archived from the original on 14 September 2017. <a href="https://web.archive.org/web/20170914052646/http://www.jollytech.com/technologies/barcode-symbologies/data-matrix-barcode.php" target="_blank">https://web.archive.org/web/20170914052646/http://www.jollytech.com/technologies/barcode-symbologies/data-matrix-barcode.php</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Stevenson, Rick (December 2005). "Laser Marking Matrix Codes on PCBs" (PDF). Printed Circuit Design and Manufacture. Retrieved 31 May 2007. <a href="http://pcdandm.com/pcdmag/mag/0512/0512stevenson.pdf" target="_blank">http://pcdandm.com/pcdmag/mag/0512/0512stevenson.pdf</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Stefan, V. (2012). The use of 2D codes in the development of mobile applications with database. Valahian Journal of Economic Studies, 3(2), 105-114. Retrieved from https://econpapers.repec.org/article/vlhjournl/v_3a3_3ay_3a2012_3ai_3a2_3ap_3a105-114.htm <a href="https://econpapers.repec.org/article/vlhjournl/v_3a3_3ay_3a2012_3ai_3a2_3ap_3a105-114.htm" target="_blank">https://econpapers.repec.org/article/vlhjournl/v_3a3_3ay_3a2012_3ai_3a2_3ap_3a105-114.htm</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>"German man programs "Hello World" into wheat field". arstechnica.com. 11 June 2007. Retrieved 22 February 2017. <a href="https://arstechnica.com/journals/thumbs.ars/2007/06/11/german-programmer-programs-hello-world-into-wheat-field" target="_blank">https://arstechnica.com/journals/thumbs.ars/2007/06/11/german-programmer-programs-hello-world-into-wheat-field</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>"Data Matrix and PDF417 Data Integrity Test" (PDF). idautomation.com. Archived from the original (PDF) on 20 August 2019. Retrieved 20 August 2019. <a href="https://web.archive.org/web/20190820162149/https://www.idautomation.com/barcode-fonts/2d/OSU-DataMatrix-PDF417.pdf" target="_blank">https://web.archive.org/web/20190820162149/https://www.idautomation.com/barcode-fonts/2d/OSU-DataMatrix-PDF417.pdf</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Engin, Thomas. "QR Code scanner online". Retrieved 27 February 2022. <a href="https://www.qr-code-scanner-online.com/" target="_blank">https://www.qr-code-scanner-online.com/</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>ISO e-commerce page for this standard http://www.iso.org/iso/iso_catalogue/catalogue_tc/catalogue_detail.htm?csnumber=44230 <a href="http://www.iso.org/iso/iso_catalogue/catalogue_tc/catalogue_detail.htm?csnumber=44230" target="_blank">http://www.iso.org/iso/iso_catalogue/catalogue_tc/catalogue_detail.htm?csnumber=44230</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>"GitHub – zxing/zxing: Official ZXing ("Zebra Crossing") project home". google.com. Retrieved 22 February 2017. <a href="https://code.google.com/p/zxing/" target="_blank">https://code.google.com/p/zxing/</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>"libdmtx Home". sourceforge.net. Retrieved 22 February 2017. <a href="http://libdmtx.sourceforge.net/" target="_blank">http://libdmtx.sourceforge.net/</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>US 5612524, Sant'Anselmo, Carl; Sant'Anselmo, Robert & Hooper, David C., "Identification symbol system and method with orientation mechanism", published 18 March 1997, issued 18 March 1997 <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5612524" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5612524</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>"Cognex Invalidates Acacia Patent '524; Next? Suing for Business Defamation". Groklaw. 23 June 2008. Archived from the original on 5 May 2010. <a href="http://www.groklaw.net/article.php?story=20080622003128295" target="_blank">http://www.groklaw.net/article.php?story=20080622003128295</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> </ol>