![]() | This article has not yet been rated on Wikipedia's content assessment scale. |
I have removed referances to Mod 11 check digits for MSI/Plessey codes. The result of a Mod 11 calculation will always be a number between 0 and 10 but MSI/Plessey can only encode numbers 0 to 9 so Mod 11 check digits make no sense. --Hooper114
I think it should be mentioned that Mod 10 is not good as a check digit as it only checks the last number. i.e.
3897984 1234 98294 726784
all make the check digit 4 so the code could be scanned completely wrong and as long as the last digit and the check digit were scanned correctly it will validate. —Preceding unsigned comment added by 92.233.245.130 ( talk) 14:10, 7 May 2008 (UTC)
I think the section 'Mod 10 Check Digit' is possibly missing a step. Step 5 has "C = Z mod 10", where Z = 2726. Then it has C = 4. I believe 2726 mod 10 = 6, not 4. Maybe the article should read "C = 10 - (Z mod 10)". I think this is right, but I am not positive, so I didn't want to edit the page. —Preceding unsigned comment added by 66.162.185.110 ( talk) 16:09, 19 October 2007 (UTC)
You are quite right. There seems to be an error in that section. It appears to me that the 'Mod 10 Check Digit' algorithm described in the IBM reference is identically the same as the algorithm described on the " Luhn algorithm" article. I'm betting that IBM is right and Wikipedia is wrong -- this time :-). Rather than correct the algorithm here, I will delete that entire section, and replace it with a very brief example, and a link to the "Luhn algorithm" article (which seems to get it right) for more details. (That's the appropriate Wikipedia:Summary style, right?) -- 68.0.124.33 ( talk) 01:08, 5 April 2008 (UTC)
There is no information on how to print an MSI code. What are valid bar ratios between wide and narrow bars? -- Nowic ( talk) 14:14, 25 February 2014 (UTC)
![]() | This article has not yet been rated on Wikipedia's content assessment scale. |
I have removed referances to Mod 11 check digits for MSI/Plessey codes. The result of a Mod 11 calculation will always be a number between 0 and 10 but MSI/Plessey can only encode numbers 0 to 9 so Mod 11 check digits make no sense. --Hooper114
I think it should be mentioned that Mod 10 is not good as a check digit as it only checks the last number. i.e.
3897984 1234 98294 726784
all make the check digit 4 so the code could be scanned completely wrong and as long as the last digit and the check digit were scanned correctly it will validate. —Preceding unsigned comment added by 92.233.245.130 ( talk) 14:10, 7 May 2008 (UTC)
I think the section 'Mod 10 Check Digit' is possibly missing a step. Step 5 has "C = Z mod 10", where Z = 2726. Then it has C = 4. I believe 2726 mod 10 = 6, not 4. Maybe the article should read "C = 10 - (Z mod 10)". I think this is right, but I am not positive, so I didn't want to edit the page. —Preceding unsigned comment added by 66.162.185.110 ( talk) 16:09, 19 October 2007 (UTC)
You are quite right. There seems to be an error in that section. It appears to me that the 'Mod 10 Check Digit' algorithm described in the IBM reference is identically the same as the algorithm described on the " Luhn algorithm" article. I'm betting that IBM is right and Wikipedia is wrong -- this time :-). Rather than correct the algorithm here, I will delete that entire section, and replace it with a very brief example, and a link to the "Luhn algorithm" article (which seems to get it right) for more details. (That's the appropriate Wikipedia:Summary style, right?) -- 68.0.124.33 ( talk) 01:08, 5 April 2008 (UTC)
There is no information on how to print an MSI code. What are valid bar ratios between wide and narrow bars? -- Nowic ( talk) 14:14, 25 February 2014 (UTC)