GS1 EPC Tag Data Standard 1.6 - Indicod-Ecr

246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250114.3.7 “6-bit CAGE/DODAAC” Encoding MethodThe 6-Bit CAGE/DoDAAC encoding method is used for a segment that appears as a 5-character CAGE code or 6-character DoDAAC in the URI, and as a 36-bit encoded bitstring in the binary encoding.Input: The input to the encoding method is the URI portion indicated in the “URIportion” row of the encoding table, a 5- or 6-character string with no dot (“.”) characters.Validity Test: The input character string must satisfy the following: It must match the grammar for CAGECodeOrDODAAC as specified in Section 6.3.9.If the above test fails, the encoding of the URI fails.Output: Consider the input to be a string of five or six characters d 1 d 2 …d N , where eachcharacter d i is a single character. Translate each character to a 6-bit string using Table 48(Appendix G). Concatenate those 6-bit strings in the order corresponding to the input. Ifthe input was five characters, prepend the 6-bit value 100000 to the left of the result. Theresulting 36-bit string is the output.14.3.8 “6-Bit Variable String” Encoding MethodThe 6-Bit Variable String encoding method is used for a segment that appears in the URIas a string field, and in the binary encoding as variable length null-terminated binaryencodedcharacter string.Input: The input to the encoding method is the URI portion indicated in the “URIportion” row of the encoding table.Validity Test: The input must satisfy the following:The input must match the grammar for the corresponding portion of the URI asspecified in the appropriate subsection of Section 6.3.The number of characters in the input must be greater than or equal to the minimumnumber of characters and less than or equal to the maximum number of charactersspecified in the footnote to the coding table for this coding table column. For thepurposes of this rule, an escape triplet (%nn) is counted as one character.For each portion of the input that matches the Escape production of the grammarspecified in Section 5 (that is, a 3-character sequence consisting of a % characterfollowed by two hexadecimal digits), the two hexadecimal characters following the %character must map to one of the characters specified in Table 48 (Appendix G), andthe character so mapped must satisfy any other constraints specified in the codingtable for this coding segment.For each portion of the input that is a single character (as opposed to a 3-characterescape sequence), that character must satisfy any other constraints specified in thecoding table for this coding segment.Output: Consider the input to be a string of zero or more characters s 1 s 2 …s N , where eachcharacter s i is either a single character or a 3-character sequence matching the Escapeproduction of the grammar (that is, a 3-character sequence consisting of a % characterfollowed by two hexadecimal digits). Translate each character to a 6-bit string. For aCopyright ©2005- 2011 GS1 AISBL, All Rights Reserved. Page 88 of 218