11.08.2015 Views

GS1 EPC Tag Data Standard 1.6 - Indicod-Ecr

GS1 EPC Tag Data Standard 1.6 - Indicod-Ecr

GS1 EPC Tag Data Standard 1.6 - Indicod-Ecr

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

2660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699(counting a 3-character escape sequence as a single character), and the number of bits inthe binary encoding is padded if necessary to a constant number of bits.The Partition Table decoding method makes use of a “partition table.” The specificpartition table to use is specified in the coding table for a given <strong>EPC</strong> scheme.Input: The input to the decoding method is the bit string identified in the “bit position”row of the coding table. Logically, this bit string is divided into three substrings,consisting of a 3-bit “partition” value, followed by two substrings of variable length.Validity Test: The input must satisfy the following:The three most significant bits of the input bit string, considered as a binary integer,must match one of the values specified in the “partition value” column of the partitiontable. The corresponding row is called the “matching partition table row” in theremainder of the decoding procedure.Extract the M next most significant bits of the input bit string following the threepartition bits, where M is the value specified in the “Compay Prefix Bits” column ofthe matching partition table row. Consider these M bits to be an unsigned binaryinteger, C. The value of C must be less than 10 L , where L is the value specified in the“<strong>GS1</strong> Company Prefix Digits (L)” column of the matching partition table row.There are N bits remaining in the input bit string, where N is the value specified in the“Other Field Bits” column of the matching partition table row. These bits mustconsist of one or more non-zero 7-bit segments followed by zero or more all-zerobits.The number of non-zero 7-bit segments that precede the all-zero bits (if any) must beless or equal to than K, where K is the value specified in the “Maximum Characters”column of the matching partition table row.Each of the non-zero 7-bit segments must have a value corresponding to a characterspecified in Table 47 (Appendix A).Output: Construct the output character string by concatenating the following threecomponents: The value C converted to a decimal numeral, padding on the left with zero (“0”)characters to make L digits in total. A dot (“.”) character. A character string determined as follows. Translate each non-zero 7-bit segment asdetermined by the validity test into a single character or 3-character escape triplet bylooking up the 7-bit segment in Table 47 (Appendix A) and using the value found inthe “URI Form” column. Concatenate the characters and/or 3-character triplet in theorder corresponding to the input bit string.14.4.6 “Numeric String” Decoding MethodThe Numeric String decoding method is used for a segment that appears as a numericstring in the URI, possibly including leading zeros. The leading zeros are preserved inthe binary encoding by prepending a “1” digit to the numeric string before encoding.Copyright ©2005- 2011 <strong>GS1</strong> AISBL, All Rights Reserved. Page 93 of 218

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!