Tool CRC-16 utility for efficiently checking data-stream integrity or generating a checksum, helping identify transfer-related corruption and confirm that exchanged information remains dependable.
CRC-16 - dCode
Tag(s) : Checksum
dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!
CRC-16 (16-bit Cyclic Redundancy Check) is a method for checking data integrity. A mathematical algorithm calculates a 16-bit checksum from a binary data stream; this value helps detect accidental errors introduced during data storage or transmission.
CRC-16 relies on binary polynomial division: the data is represented as a polynomial with binary coefficients.
Example: The binary sequence 1101 corresponds to the polynomial $ 1 \times x^3 + 1 \times x^2 + 0 \times x^1 + 1 \times x^0 = x^3 + x^2 + x^0 $ (each bit indicates the presence or absence of a term, starting with power 0 on the right).
A predefined binary polynomial, called the generator polynomial (or divisor), is then used in the calculation.
Common CRC-16 generator polynomials include 8005 (hexadecimal), used by variants such as IBM/ARC, MODBUS and USB, corresponding to the degree-16 polynomial $ x^{16} + x^{15} + x^2 + x^0 $; and 1021 (hexadecimal), used by variants such as CCITT-FALSE, XMODEM, KERMIT and X-25, corresponding to the polynomial $ x^{16} + x^{12} + x^5 + x^0 $.
The calculation uses polynomial division modulo 2, in which additions and subtractions are replaced by XOR operations. The resulting remainder has a degree below 16 and can be represented using 16 bits: it constitutes the CRC-16 checksum. The final result also depends on the parameters of the selected variant, including the initial value, bit reflection and final XOR.
CRC-16 produces a shorter checksum than CRC-32, reducing the space required to store and transmit it. Its computational cost is generally low, but execution speed depends on the implementation and hardware. It is particularly suitable for detecting errors in stored or transmitted data, especially on resource-limited systems and serial links.
CRC-16 does not prevent or correct errors: it detects certain data alterations with good reliability when the selected variant is appropriate for the application. It is used in industrial protocols (Modbus), file transfer protocols (XMODEM), serial communications (Kermit), the USB bus and many embedded systems.
CRC-16 is not a cryptographic hash function and does not guarantee the absence of errors. Different data can produce the same checksum. Assuming a uniform distribution of results, the collision probability for two independent results is 1 in 65536. CRC-16 must therefore not be used on its own to protect data against malicious modification.
A CRC-16 checksum is usually represented by four hexadecimal digits, equivalent to 16 bits. It may also be displayed as an integer ranging from 0 to 65535 or as two bytes. The representation depends on the format and byte order (endianness).
CRC-16 refers to a family of variants rather than a single algorithm. There is therefore no universal "default CRC-16". Several variants are widely used or well known:
— CRC-16/CCITT-FALSE: this variant uses the polynomial 1021, an initial value of 0xFFFF, no bit reflection and a final XOR of 0x0000. It is used in various industrial applications and software libraries.
— CRC-16/IBM, also called CRC-16/ARC: this historical variant uses the polynomial 8005, an initial value of 0x0000, input and output bit reflection and a final XOR of 0x0000. It appears in various software tools and embedded systems.
Other variants are common in specific contexts.
CRC-16 encompasses many variants that differ in their generator polynomial, initial value, input and output bit reflection, and final XOR applied to the remainder. These parameters determine the result, even when multiple variants use the same polynomial. Here are some common variants:
— CRC-16/IBM (also called ARC): polynomial 8005, initial value 0x0000, input/output reflection, final XOR 0x0000; used in various software tools and embedded systems.
— CRC-16/CCITT-FALSE: polynomial 1021, initial value 0xFFFF, no reflection, final XOR 0x0000; used in some telecommunications applications and software libraries.
— CRC-16/XMODEM: polynomial 1021, initial value 0x0000, no reflection, final XOR 0x0000; used in the XMODEM file transfer protocol.
— CRC-16/MODBUS: polynomial 8005, initial value 0xFFFF, input/output reflection, final XOR 0x0000; used in the Modbus protocol.
— CRC-16/KERMIT: polynomial 1021, initial value 0x0000, input/output reflection, final XOR 0x0000; used in the Kermit protocol.
— CRC-16/X-25: polynomial 1021, initial value 0xFFFF, input/output reflection, final XOR 0xFFFF; used notably in protocols derived from X.25 and HDLC.
— CRC-16/USB: polynomial 8005, initial value 0xFFFF, input/output reflection, final XOR 0xFFFF; used in the USB protocol.
CRC-16 variants are not necessarily compatible with each other. Different parameters can produce different checksums for the same data, even when the generator polynomial is identical.
dCode retains ownership of the "CRC-16" source code. Any algorithm for the "CRC-16" algorithm, applet or snippet or script (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or any "CRC-16" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) or any database download or API access for "CRC-16" or any other element are not public (except explicit open source licence). Same with the download for offline use on PC, mobile, tablet, iPhone or Android app.
Reminder: dCode is an educational and teaching resource, accessible online for free and for everyone.
The content of the page "CRC-16" and its results may be freely copied and reused, including for commercial purposes, provided that dCode.fr is cited as the source (Creative Commons CC-BY free distribution license).
Exporting the results is free and can be done simply by clicking on the export icons ⤓ (.csv or .txt format) or ⧉ (copy and paste).
To cite dCode.fr on another website, use the link:
In a scientific article or book, the recommended bibliographic citation is: CRC-16 on dCode.fr [online website], retrieved on 2026-11-19,