summaryrefslogtreecommitdiffstats
path: root/scripts/Makefile.headersinst
diff options
context:
space:
mode:
authorRoger Knecht <roger@norberthealth.com>2022-05-21 14:47:45 +0200
committerJason A. Donenfeld <Jason@zx2c4.com>2022-06-07 10:27:38 +0200
commit77991645952c21962a095910c51fe0f73d35bf91 (patch)
tree390109e8afbf963abde0928317275fefb85c58db /scripts/Makefile.headersinst
parentMerge tag 'dma-mapping-5.19-2022-06-06' of git://git.infradead.org/users/hch/... (diff)
downloadlinux-77991645952c21962a095910c51fe0f73d35bf91.tar.xz
linux-77991645952c21962a095910c51fe0f73d35bf91.zip
crc-itu-t: fix typo in CRC ITU-T polynomial comment
The code comment says that the polynomial is x^16 + x^12 + x^15 + 1, but the correct polynomial is x^16 + x^12 + x^5 + 1. Quoting from page 2 in the ITU-T V.41 specification [1]: 2 Encoding and checking process The service bits and information bits, taken in conjunction, correspond to the coefficients of a message polynomial having terms from x^(n-1) (n = total number of bits in a block or sequence) down to x^16. This polynomial is divided, modulo 2, by the generating polynomial x^16 + x^12 + x^5 + 1. The hex (truncated) polynomial 0x1021 and CRC code implementation are correct, however. [1] https://www.itu.int/rec/T-REC-V.41-198811-I/en Signed-off-by: Roger Knecht <roger@norberthealth.com> Acked-by: Randy Dunlap <rdunlap@infradead.org> Signed-off-by: Jason A. Donenfeld <Jason@zx2c4.com>
Diffstat (limited to 'scripts/Makefile.headersinst')
0 files changed, 0 insertions, 0 deletions