DPD Paketschein Spezifikation 1.7 D

DPD Paketschein Spezifikation Version 1.7 _ 2011-11-17
Beispiel 2:
Zeichenkette: ABC987
Initialisierung:
mod = 36
cd = 36
Zeichen val cd = cd + val ? cd > mod cd = cd * 2 ? cd > mod cd
cd = cd - mod
cd = cd - (mod+1)
A 10 36 + 10 = 46 46 – 36 = 10 10 * 2 = 20 20
B 11 20 + 11 = 31 31 * 2 = 62 62 – 37 = 25 25
C 12 25 + 12 = 37 37 – 36 = 1 1 * 2 = 2 2
9 9 2 + 9 = 11 11 * 2 = 22 22
8 8 22 + 8 = 30 30 * 2 = 60 60 – 37 = 23 23
7 7 23 + 7 = 30 30 * 2 = 60 60 – 37 = 23 23
Abschluss:
cd = (mod + 1) – cd � (37) – 23 = 14
? cd = mod � (nein)
cd = 14 ���� entspricht ‘E’
Implementation des Algorithmus in C:
/*
Document ISO/IEC 7064:2003
Algorithm: hybrid system recursive
as described in chapter 10.1.1
Naming of variables and algorithm is related to the document for easier
understanding
ISO/IEC 7064, MOD 37,36
param s String to generate check character for
return check character
or -1 if character exceeds ascii2isoval table
Author: Marc Sierszen, Peter Liebel
DELICom DPD GmbH & Co. KG
*/
char get_iso7064_mod37_36(char *s)
{
int i;
int P=0;
int M, M1; /* Modulus */
/* table convert ASCII character to ISO/IEC 7064 values */
char ascii2isoval[] = {
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 1, 2 ,3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0,
0,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,
25,26,27,28,29,30,31,32,33,34,35,0, 0, 0, 0, 0,
0,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24, /* handle lower
characters like upper characters */
25,26,27,28,29,30,31,32,33,34,35};
DELICom
Gerhard Lanzer, BA DPD_Paketscheinspezifikation_V1.7_2011-11-17 Seite 26 / 101