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.

25822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619input bit string. The resulting character string is the output. This character stringmatches the GS3A3 production of the grammar in Section 5.14.4.3 “Partition Table” Decoding MethodThe Partition Table decoding method is used for a segment that appears in the URI as apair of variable-length numeric fields separated by a dot (“.”) character, and in thebinary encoding as a 3-bit “partition” field followed by two variable length binaryintegers. The number of characters in the two URI fields always totals to a constantnumber of characters, and the number of bits in the binary encoding likewise totals to aconstant 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. Consider these N bitsto be an unsigned binary integer, D. The value of D must be less than 10 K , where K isthe value specified in the “Other Field Digits (K)” column of the matching partitiontable row. Note that if K = 0, then the value of D must be zero.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. The value D converted to a decimal numeral, padding on the left with zero (“0”)characters to make K digits in total. If K = 0, append no characters to the dot above(in this case, the final URI string will have two adjacent dot characters when thissegment is combined with the following segment).Copyright ©2005- 2011 <strong>GS1</strong> AISBL, All Rights Reserved. Page 91 of 218

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

Saved successfully!

Ooh no, something went wrong!