noteID,note
1,A data bin is a data point representing the volume centred on it.
2,"A group containing only missing values (of either type) will be encoded as a constant group (null width, no associated data) and the group reference will have all bits set to 1 for primary type, and all bits set to 1, except the last bit set to 0, for secondary type."
3,"A logarithm pre-processing algorithm is used to fit the variability range into one or two order of magnitudes before using the simple packing algorithm. It requires a parameter (B) to assure that all values passed to the logarithm function arepositive. Thus scaled values are Z = ln (Y+B), where Y are the original values, ln is the natural logarithm (or Napierian)function and B is chosen so that Y+B > 0."
4,"A quasi-regular grid is only defined for appropriate grid scanning modes. Either rows or columns, but not both simultaneously, may have variable numbers of points or variable spacing. The first point in each row (column) shall be positioned at the meridian (parallel) indicated by octets 47-54. The grid points shall be evenly spaced in latitude (longitude)."
5,"A scaled value of radius of spherical Earth, or major or minor axis of oblate spheroid Earth, is derived by applying the appropriate scale factor to the value expressed in metres."
6,A single partition with code value PN from the partition set composed by the NP partitions is represented in the template. The code values of the NP partitions are expressed in octets 14 to 14+2NP-1. The NP partitions are linked by the normalization formula stating that the sum of all the NP partitions must be equal to a normalization term (N) on each point of the grid.
7,"An increment of zero means that the statistical processing is the result of a continuous (or near-continuous) process, not the processing of a number of discrete samples. Examples of such continuous processes are the temperatures measured by analogue maximum and minimum thermometers or thermographs, and the rainfall measured by a rain gauge."
8,"As an extra option, substitute value(s) for missing data may be specified. If not wished (or not applicable), all bits should be set to 1 for relevant substitute value(s)."
9,"Basic angle of the initial production domain and subdivisions of this basic angle are provided to manage cases where the recommended unit of 10-6 degrees is not applicable to describe the longitudes and latitudes, and direction increments. For these descriptors, the unit is equal to the ratio of the basic angle and the subdivisions number. For ordinary cases, zero and missing values should be coded, equivalent to the respective values of 1 and 106 (10-6 degrees unit)."
10,"Best practice follows for choosing the B pre-processing parameter.(a) If the data set minimum value is positive, B can be safely put to zero.(b) If the data set minimum is zero, all values must be scaled to become greater than zero and B can be equal to the minimum positive value in the data set."
11,Bit 2 of the projection flag is not applicable to the polar stereographic projection.
12,Data shall be packed using data template 7.
13,"Extra descriptors related to spatial differencing are added before the splitting descriptors, to reflect the separation between the two approaches. It enables to share software parts between cases with and without spatial differencing."
14,"For ""satellite series of band nb"", ""satellite numbers of band nb"" and ""instrument types of band nb"", it is recommended to encode the values as per BUFR Code tables 0 02 020, 0 01 007 (Common Code table C-5) and 0 02 019 (Common Code table C-8), respectively."
15,"For data on a quasi-regular grid, where all the rows or columns do not necessarily have the same number of grid points, either Ni (octets 31-34) or Nj (octets 35-38) and the corresponding Di (octets 64-67) or Dj (octets 68-71) shall be coded with all bits set to 1 (missing). The actual number of points along each parallel or meridian shall be coded in the octets immediately following the grid definition template (octets [xx+1]-nn), as described in the description of the grid definition section"
16,"For differencing of order n, the first n values in the array that are not missing are set to zero in the packed array. These dummy values are not used in unpacking."
17,"For groups with a constant value, associated field width is 0, and no incremental data are physically present."
18,"For more details, see Part B, GRIB Attachment I."
19,"For more information, see Part B, GRIB Attachment III."
20,"For more information, see Part B, GRIB Attachment IV."
21,"For most templates, details of the packing process are described in Regulation 92.9.4."
22,"For orthographic view from infinite distance, the value of Nr should be encoded as missing (all bits set to 1)."
23,"For row by row packing with a bit-map, there should always be as many groups as rows. In case of rows with only missing values, all associated descriptors should be coded as zero."
24,"For simplicity, image data should be packed specifying a single component (i.e. greyscale image) instead of a multicomponent colour image."
25,"For some spectral representations, the (0.0) coefficient represents the mean value of the parameter represented."
26,For the list of Ni longitude bounds and Nj latitude bounds at the end of the section: ii = 60 + 4Ni and jj = 60 + 4Ni +4Nj
27,"General reference information pertaining to the projections used for satellite data can be found in Section 4.4 of ""LRIT/HRIT Global Specification"", Doc. No. CGMS 03, issue 2.6, dated 12 August 1999 (http://www.eumetsat.int/Home/Main/AboutEUMETSAT/International Relations/CGMS/groups/cps/documents/document/pdf_cgms_03.pdf, page 20 onwards)."
28,Grid length is in units of 10-3 m at the latitude specified by LaD.
29,"Grid lengths are in units of 10–3 m, at the latitude specified by the standard parallel."
30,Group descriptors mentioned above may not be physically present; if associated field width is 0.
31,"Group lengths have no meaning for row by row packing, where groups are coordinate lines (so the grid description section and possibly the bit-map section are enough); for consistency, associated field width and reference should then be encoded as 0."
32,"Group lengths have no meaning for row by row packing; for consistency, associated field width should then been coded as 0. So no specific test for row by row case is mandatory at decoding software level to handle encoding/decoding of group descriptors."
33,Hours greater than 65534 will be coded as 65534.
34,"If Latin 1 = Latin 2, then the projection is on a tangent cone."
35,"If necessary, group widths and/or field width of group references may be enlarged to avoid ambiguities between missing value indicator(s) and true data."
36,"If Number of modes (N) > 1, then between x N fields with mode number l = 1, …, N define the distribution function. x is the number of variable parameters in the distribution function."
37,"If octet 20 of data representation template 5.41 specifies the data are packed into either 1, 2, 4, 8, or 16 bits, then encode the ""image"" as a greyscale image. If octet 20 specifies 24 bits, encode the ""image"" as a Red-Green-Blue (RGB)colour image with 8-bit depth for each colour component, and finally if octet 20 is 32, encode the ""image"" as an RGBcolour image with an alpha sample using 8-bit depth for each of the four components."
38,"If primary missing values are used, such values are encoded within appropriate group with all bits set to 1 at packed data level."
39,"If secondary missing values are used, such values are encoded within appropriate group with all bits set to 1, except the last one set to 0, at packed data level."
40,"If substitute value(s) are specified, type of content should be consistent with original field values (floating-point - and then IEEE 32-bit encoded-, or integer)."
41,"In most cases, multiplying Ni (octets 31-34) by Nj (octets 35-38) yields the total number of points in the grid. However, this may not be true if bit 8 of the scanning mode flags (octet 72) is set to 1."
42,"It is assumed that the satellite is at its nominal position, i.e. it is looking directly at its sub-satellite point."
43,It is recommended not to use this template. PDT 4.48 should be used instead with optical wavelength range set to missing.
44,It is recommended not to use this template. Product definition template 4.84 should be used instead because it contains an additional octet to specify the type of generating process.
45,It is recommended to use unsigned direction increments.
46,It is the angle between the increasing y-axis and the meridian 180°E if the sub-satellite point is the North Pole; or the meridian 0° if the sub-satellite point is the South Pole.
47,JPEG 2000 should not be used for bit-mapped or quasi-regular grid data.
48,"Library flags governing data type, and storage and processing parameters. For further information, see Rosenhauer,Mathis. “Flags.” libaec – Adaptive Entropy Coding library. German Climate Computing Centre (DeutschesKlimarechenzentrum, DKRZ), 12 May 2016. Web. 13 June 2016.<http:/gitlab.dkrz.de/k202009/libaec/blob/v0.3.3/README.md#flags>."
49,"Limited to the range of 0 to 90 degrees; if the angle of orientation of the grid is neither 0 nor 90 degrees, Di and Dj must be equal to each other."
50,Limited to the range of 0 to 90 degrees.
51,LoV is the longitude value of the meridian which is parallel to the y-axis (or columns of the grid) along which latitude increases as the y-coordinate increases (the orientation longitude may or may not appear on a particular grid).
52,Management of explicitly missing values is an alternative to bit-map use within Section 6; it is intended to reduce the whole GRIB message size.
53,"Management of widths into a reference and increments, together with management of lengths as scaled incremental values, are intended to save descriptor size (which is an issue as far as compression gains are concerned)."
54,Matrices restricted to scanning in the +i direction (left to right) and in the –j direction (top to bottom).
55,"Matrix bit maps will be present only if indicated by octet 22. If present, there shall be one bit map for each grid point with data values, as defined by the primary bit map in Section 6, each of length (NR x NC) bits: a bit set to 1 will indicate a data element at the corresponding location within the matrix. Bit maps shall be represented end-to-end, without regard for octet boundaries; the last bit map shall, if necessary, be followed by bits set to zero to fill any partially used octet."
56,Negative values of E or D shall be represented according to Regulation 92.1.5.
57,"Number of octets associated with each value of the unpacked subset (I) is defined in Code table 5.7, according to the actual value in octet 35 of data representation template 5.51."
58,"NUT is the number of used different spatial tiles, defining the cover structure of a point. As each of these tiles has one or more different tile attributes A(NAT(ITN)), (ITN=1,…,NUT), for example, (unmodified, snow-covered,…),......"
59,Octets 69–72 shall be set to all ones (missing) to indicate the orthographic view (from infinite distance).
60,Only parameters expressing fractions or percentages can be used in this template. Code tables shall state clearly that they are meant to be used in partitioned parameters context.
61,"Overall minimum will be negative in most cases. First bit should indicate the sign: 0 if positive, 1 if negative."
62,"PNG does not support all bit-depths in an image, so it is necessary to define which depths can be used and how they are to be treated. For greyscale images, PNG supports depths of 1, 2, 4, 8 or 16 bits. Red-Green-Blue (RGB) colour images can have depths of 8 or 16 bits with an optional alpha sample. Valid values for octet 20 can be:1, 2, 4, 8, or 16 : Treat as greyscale image24 : Treat as RGB colour image (each component having 8-bit depth)32 : Treat as RGB w/ alpha sample colour image (each component having 8-bit depth)"
63,Reference = reference time (section 1) + forecast range (PDT) + offset and increments from reference time (GDT).
64,"Referring to the notation in Note 1 of data representation template 5.3, at order 1, the values stored in octets 6–ww areg1 and gmin. At order 2, the values stored are h1, h2, and hmin."
65,Regulation 92.1.6 applies.
66,"Removal of the real part of (0.0) coefficient from packed data is intended to reduce the variability of the coefficients, in order to improve packing accuracy."
67,"Scaled group lengths, if present, are encoded for each group. But the true last group length (unscaled) should be taken from data representation template."
68,See data template 7.2 and associated Notes for complementary information.
69,See data template 7.3 and associated Notes for complementary information.
70,Set code to missing if analysis.
71,"Some simple coordinate functional forms are tabulated in Code table 5.2. Where a more complex coordinate function applies, the coordinate values shall be explicitly denoted by the inclusion of the actual set of values rather than the coefficients. This shall be indicated by a code figure 0 from Code table 5.2; the number of explicit values coded shall be equal to the appropriate dimension of the matrix for which values are presented and they shall follow octet 36 in place of the coefficients."
72,"Spatial differencing is a pre-processing before group splitting at encoding time. It is intended to reduce the size of sufficiently smooth fields, when combined with a splitting scheme as described in data representation template 5.2. Atorder 1, an initial field of values f is replaced by a new field of values g, where g1 = f1, g2 = f2 – f1, …, gn = fn – fn–1. Atorder 2, the field of values g is itself replaced by a new field of values h, where h1 = f1, h2 = f2, h3 = g3 – g2, …, hn = gn –gn–1. To keep values positive, the overall minimum of the resulting field (either gmin or hmin) is removed. At decoding time, after bit string unpacking, the original scaled values are recovered by adding the overall minimum and summing up recursively."
73,The apparent angular size of the Earth will be given by 2 x arcsin ((106)/Nr).
74,"The compression ratio M:1 (e.g. 20:1) specifies that the encoded stream should be less than ((1/M) x depth x number of data points) bits, where depth is specified in octet 20 and the number of data points in octets 6–9 of the data representation section."
75,"The Consultative Committee for Space Data Systems (CCSDS) recommended standard for lossless data compression is the standard used by space agencies for the compression of scientific data transmitted from satellites and other space instruments. CCSDS recommended standard for lossless data compression is a very fast predictive compression algorithm based on the extended-Rice algorithm. It uses Golomb–Rice codes for entropy coding. The sequence of prediction errors is divided into blocks. Each block is compressed using a two-pass algorithm. In the first pass, the best coding method for the whole block is determined. In the second pass, the output of the marker of the selected coding method is encoded as ancillary information along with prediction errors.The coding methods include:• Golomb–Rice codes of a chosen rank• Unary code for transformed pairs of prediction errors• Fixed-length natural binary code if the block is found to be incompressible• Signalling to the decoder empty block if all prediction errors are zeroes"
76,"The essence of the complex packing method is to subdivide a field of values into NG groups, where the values in each group have similar sizes. In this procedure, it is necessary to retain enough information to recover the group lengths upon decoding. The NG group lengths for any given field can be described by Ln = ref + Kn x len_inc, n = 1, NG, where ref is given by octets 38-41 and len_inc by octet 42. The NG values of K (the scaled group lengths) are stored in the data section, each with the number of bits specified by octet 47. Since the last group is a special case which may not be able to be specified by this relationship, the length of the last group is stored in octets 43-46."
77,The exponent of 3 for the number of divisions of triangle sides is used only with a value of either 0 or 1.
78,The group length (L) is the number of values in a group.
79,The group width is the number of bits used for every value in a group.
80,"The horizontal and vertical angular resolutions of the sensor (Rx and Ry), needed for navigation equation, can be calculated from the following:Rx = 2 x arcsin ((106)/Nr)/dxRy = 2 x arcsin ((106)/Nr)/dy"
81,"The input originating centre shall have the value of the ""originating centre"" of the original GRIB message used as input of the post-processing."
82,"The input process identifier shall have the value of the ""analysis or forecast process identifier"" of the original GRIB message used as input of the post-processing."
83,"The intent of this template is to scale the grid point data to obtain the desired precision, if appropriate, and then subtract the reference value from the scaled field, as is done using data representation template 5.0. After this, the resulting grid point field can be treated as a greyscale image and encoded into the CCSDS recommended standard for lossless data compression code stream format. To unpack the data field, the CCSDS recommended standard for lossless data compression code stream is decoded back into an image, and the original field is obtained from the image data as described in regulation 92.9.4, Note 4."
84,The JPEG 2000 standard specifies that the bit-depth must be in the range of 1 to 38 bits.
85,"The list of Ni longitudes and Nj latitudes shall be coded in the octets immediately following the grid definition template in octets 49 to ii and octets ii+1 to jj respectively, where ii = 48 + 4Ni and jj = 48 + 4Ni + 4Nj."
86,"The number given refers to a specific grid required for formulating differential operators. The grid may consist of acentre and an arbitrary surrounding polygon. As model variables may be defined on vertices of the polygons or in the middle of a polygon edge, this generates some different grid descriptions, because each of those is defining their own centre and surrounding polygon. Each of these dependent grids needs their own set of centrelongitude/latitude and the longitude/latitude of the boundary polygon vertices. The following picture shows atriangle as base, a hexagon around the triangle's vertices and a quadrilateral around the edge midpoints.(a) Triangles (i) (pressure, temperature, ...)(b) Quadrilaterals (l) (wind velocity ...)(c) Hexagons (or pentagons, respectively) (v) (vorticity, ...)"
87,The number of parallels between a pole and the Equator is used to establish the variable (Gaussian) spacing of the parallels; this value must always be given.
88,"The order of the data points should remain as specified in the scanning mode flags (Flag table 3.4) set in the appropriate grid definition template, even though the JPEG 2000 standard specifies that an image is stored starting at the top left corner. Assuming that the encoding software is expecting the image data in raster order (left to right across rows for each row), users should set the image width to Ni (or Nx) and the height to Nj (or Ny) if bit 3 of the scanning mode flag equals 0 (adjacent points in i (x) order), when encoding the ""image"". If bit 3 of the scanning mode flags equals 1 (adjacent points in j (y) order), it may be advantageous to set the image width to Nj (or Ny) and the height to Ni (or Nx)."
89,"The order of the data points should remain as specified in the scanning mode flags (Flag table 3.4) set in the appropriate grid definition template, even though the PNG standard specifies that an image is stored starting at the top left corner andscans each row from left to right, starting with the top row. Users should set the image width to Ni (or Nx) and the height to Nj (or Ny) if bit 3 of the scanning mode flag equals 0 (adjacent points in i (x) order), when encoding the ""image"". If bit 3 of the scanning mode flags equals 1 (adjacent points in j (y) order), it may be advantageous to set the image width to Nj(or Ny) and the height to Ni (or Nx)."
90,"The origin of the grid is an icosahedron with 20 triangles and 12 vertices. The triangles are combined to nd quadrangles,the so-called diamonds (e.g. if nd = 10, two of the icosahedron triangles form a diamond, and if nd = 5, 4 icosahedron triangles form a diamond). There are two resolution values called n2 and n3 describing the division of each triangle side.Each triangle side is divided into ni equal parts, where ni = 3n3 x 2n2 with n3 either equal to 0 or to 1. In the example in GRIB Attachment I, the numbering order of the rectangles is anti-clockwise with a view from the pole point on both hemispheres. Diamonds 1 to 5 are northern hemisphere and diamonds 6 to 10 are southern hemisphere."
91,"The pentagonal representation of resolution is general. Some common truncations are special cases of the pentagonal one: Triangular: M = J = K Rhomboidal: K = J + M Trapezoidal: K = J, K > M [OR] See the Note under grid definition template 3.50 – spherical harmonic coefficients."
92,The position of overall minimum after initial data values is a choice that enables less software management.
93,"The purpose of this template is to scale the grid point data to obtain the desired precision, if appropriate, and then subtract out the reference value from the scaled field as is done using data representation template 5.0. After this, the resulting grid point field can be treated as a greyscale image and is then encoded into the JPEG 2000 code streamformat. To unpack the data field, the JPEG 2000 code stream is decoded back into an image, and the original field is obtained from the image data as described in Regulation 92.9.4, Note 4."
94,"The purpose of this template is to scale the grid point data to obtain the desired precision, if appropriate, and then subtract out the reference value from the scaled field, as is done using data representation template 5.0. After this, the resulting grid point field can be treated as an image and is then encoded into PNG format. To unpack the data field, the PNG stream is decoded back into an image, and the original field is obtained from the image data as described in Regulation 92.9.4, Note 4."
95,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets 46, 58, 70, ...). For all but the innermost (last) time range, the next inner range is then processed using these references and forecast times as the initial reference and forecast times."
96,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets 48, 60, 72, ...). For all but the innermost (last) time range, the next inner range is then processed using these reference and forecast times as the initial reference and forecast times."
97,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets 50, 62, 74, ...). For all but the innermost (last) time range, the next inner range is then processed using these reference and forecast times as the initial reference and forecast times."
98,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets 51, 62, 73, ...). For all but the innermost (last) time range, the next inner range is then processed using these reference and forecast times as the initial reference and forecast times."
99,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets 51, 63, 75, ...). For all but the innermost (last) time range, the next inner range is then processed using these reference and forecast times as the initial reference and forecast times."
100,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets 53, 65, 77, …). For all but the innermost (last) time range, the next inner range is then processed using these reference and forecast times as the initial reference and forecast times."
101,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets 54, 66, 78, …). For all but the innermost (last) time range, the next inner range is then processed using these reference and forecast times as the initial reference and forecast times."
102,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets 56, 68, 80, ...). For all but the innermost (last) time range, the next inner range is then processed using these reference and forecast times as the initial reference and forecast times."
103,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets 57, 69, 81, ...). For all but the innermost (last) time range, the next inner range is then processed using these reference and forecast times as the initial reference and forecast times."
104,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets 61, 72, ...). For all but the innermost (last) time range, the next inner range is then processed using these reference and forecast times as the initial reference and forecast times."
105,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets 62, 74, ...). For all but the innermost (last) time range, the next inner range is then processed using these reference and forecast times as the initial reference and forecast times."
106,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets 63, 65, 77, ...). For all but the innermost (last) time range, the next inner range is then processed using these reference and forecast times as the initial reference and forecast times."
107,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets 63, 75, ...). For all but the innermost (last) time range, the next inner range is then processed using these reference and forecast times as the initial reference and forecast times."
108,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets 78, 90, 112, ...). For all but the innermost (last) time range, the next inner range is then processed using these reference and forecast times as the initial reference and forecast times."
109,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets 82, 94, 106,....). For all but the innermost (last) time range, the next inner range is then processed using these reference and forecast times as the initial reference and forecast times."
110,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment. For all but the innermost (last) time range, the next inner range is then processed using these references and forecast times as the initial reference and forecast times."
111,The reference time in section 1 and the forecast time together define the beginning of the overall time interval.
112,"The remaining coefficients are multiplied by (n x (n+1))P, scaled and packed. The operator associated with this multiplication is derived from the Laplacian operator on the sphere."
113,"The remaining coefficients are multiplied by (n2+m2)P, scaled and packed. The operator associated with this multiplication is derived from the Laplacian operator."
114,The resolution flags (bits 3-4 of Flag table 3.3) are not applicable.
115,The retrieval formula for a coefficient of wave number n is then: Y = (R + X x 2E) x 10–D x (m2+n2)–P where X is the packed scaled value associated with the coefficient.
116,The retrieval formula for a coefficient of wave number n is then: Y = (R + X x 2E) x10–D x (n x (n+1))–P where X is the packed scaled value associated with the coefficient.
117,"The stretching is defined by three parameters: (a) The latitude in degrees (measured in the model coordinate system) of the 'pole of stretching'; (b) The longitude in degrees (measured in the model coordinate system) of the ""pole of stretching""; and (c) The stretching factor C in units of 10-6 represented as an integer. The stretching is defined by representing data uniformly in a coordinate system with longitude λ and latitude θ1, where: {{IMAGE}} and λ and θ are longitude and latitude in a coordinate system in which the ""pole of stretching"" is the northern pole. C = 1 gives uniform resolution, while C > 1 gives enhanced resolution around the pole of stretching. [OR] See Note 2 under grid definition template 3.2 – stretched latitude/longitude (or equidistant cylindrical, or Plate Carrée)."
118,"The total number of grid points for one global field depends on the grid point position. If e.g. the grid points are located at the vertices of the triangles, then nt = (ni + 1) x (ni + 1) x nd since grid points at diamond edges are contained in both adjacent diamonds and for the same reason the pole points are contained in each of the five adjacent diamonds."
119,"The unpacked subset is a set of values defined in the same way as the full set of values (on a spectrum limited to JS, KS and MS), but on which scaling and packing are not applied. Associated values are stored in octets 6 onwards of Section 7."
120,"The unpacked subset is a set of values defined in the same way as the full set of values (on a spectrum limited to NS and MS), but on which scaling and packing are not applied. Associated values are stored in octets 6 onwards of Section 7."
121,"The word ""fraction"" or the word ""percentage"" has to be explicitly used in the name of the parameter to refer to a normalization term N = 1 in the case of ""fraction"" and N = 100 in the case of percentage."
122,The year can be recovered with the formula: Year (real/decoded) = Year + 10 000 x Offset
123,"There may be two types of missing value(s), such as to make a distinction between static misses (for instance, due to a land/sea mask) and occasional misses."
124,These octets are only present for quasi-regular grids.
125,"This form of representation enables a matrix of values to be depicted at each grid point; the two dimensions of the matrix may represent coordinates expressed in terms of two elemental parameters (e.g. direction and frequency for wave spectra). The numeric values of these coordinates, beyond that of simple subscripts, can be given in a functional form, or as a collection of explicit numbers."
126,This identifies which post-processing technique was used. This is defined by the originating centre.
127,This is the date when the reforecast is produced with a particular version of the model.
128,This template is appropriately designed for data sets with all non-negative values and a wide variability range (more than 5 orders of magnitude). It must not be used for data sets with negative values or smaller variability range.
129,This template is deprecated. Template 4.31 should be used instead.
130,"This template is experimental, was not validated at the time of publication and should be used only for bilateral previously agreed tests."
131,"This template is experimental, was not validated at the time of publication and should be used only for bilateral previously agreed tests. (Octets 35-50 are very similar to octets 43-58 of product definition template 4.8, but the meaning of some fields differs slightly.)"
132,"This template should not be used when the data points are not available on a rectangular grid, such as occurs if some data points are bit-mapped out or if section 3 describes a quasi-regular grid. If it is necessary to use this template on such a grid, the data field can be treated as a one-dimensional image where the height is set to 1 and the width is set to the total number of data points specified in octets 6–9."
133,This template should not be used. Product definition template 4.0 should be used instead.
134,This template was not validated at the time of publication and should be used with caution. Please report any use to the WMO Secretariat to assist with validation.
136,"Three parameters define a general latitude/longitude coordinate system, formed by a general rotation of the sphere. One choice for these parameters is: (a) The geographic latitude in degrees of the southern pole of the coordinate system, θp for example; (b) The geographic longitude in degrees of the southern pole of the coordinate system, λp for example; (c) The angle of rotation in degrees about the new polar axis (measured clockwise when looking from the southern to the northern pole) of the coordinate system, assuming the new axis to have been obtained by first rotating the sphere through λp degrees about the geographic polar axis, and then rotating through (90 + θp) degrees so that the southern pole moved along the (previously rotated) Greenwich meridian. [OR] See Note 2 under grid definition template 3.1 – rotated latitude/longitude (or equidistant cylindrical, or Plate Carrée)."
137,"Values ordering within the packed data is done according to the source of grid definition, skipping the values processed in the unpacked subset."
138,Values ordering within the unpacked subset is defined according to the source of grid definition associated with the data.
139,"Years before year 1 shall be coded as defined in ISO 8601 (year 1 is followed by year 0). If applicable, year -1 or before shall be indicated by setting the most significant bit of octets 13-14 and 24-25 to ""1"" in accordance with Regulation 92.1.5."
140,"This represents the length of time over which the statistical processing was applied. The local time defined in section 1 represents the end of this processing. For instance, a value of 24 h corresponds to a statistical processing between the previous day at local time and this day at local time."
141,"This represents the number of statistically processed fields (or stripes) used to create the composite local time field. For instance, a value of 8 means that 8 statistically processed fields have been used in the processing, each of them representing a section of 45 degrees of longitude (360/8) centred around the UTC time corresponding to the local time."
142,"This is the number of forecasts and time steps used to create the statistically processed fields. These implicitly have the same statistical process as defined in octet 27. If a forecast has 2 time increments (3 hourly day 1 to 5 then 6 hourly), it should be encoded as 2 forecasts with the same reference time, using the appropriate starting forecast time and time increments."
143,"This also represents the length of time range of the statistically processed fields. For instance, to create a 24 h accumulation (encoded in octets 29-32), we could use several 3 h accumulations, or 6 h accumulations, a mixture of the two, etc."
144,"This is the number of forecasts and time steps used to create the statistically processed fields. These implicitly have the same statistical process as defined in octet 30. If a forecast has 2 time increments (3 hourly day 1 to 5 then 6 hourly), it should be encoded as 2 forecasts with the same reference time, using the appropriate starting forecast time and time increments."
145,"This also represents the length of time range of the statistically processed fields. For instance, to create a 24 h accumulation (encoded in octets 32-35), we could use several 3 h accumulations, or 6 h accumulations, a mixture of the two, etc."
146,"This is the number of forecasts and time steps used to create the statistically processed fields. These implicitly have the same statistical process as defined in octet 32. If a forecast has 2 time increments (3 hourly day 1 to 5 then 6 hourly), it should be encoded as 2 forecasts with the same reference time, using the appropriate starting forecast time and time increments."
147,"This also represents the length of time range of the statistically processed fields. For instance, to create a 24 h accumulation (encoded in octets 34-37), we could use several 3 h accumulations, or 6 h accumulations, a mixture of the two, etc."
148,"This is the number of forecasts and time steps used to create the statistically processed fields. These implicitly have the same statistical process as defined in octet 35. If a forecast has 2 time increments (3 hourly day 1 to 5 then 6 hourly), it should be encoded as 2 forecasts with the same reference time, using the appropriate starting forecast time and time increments."
149,"This also represents the length of time range of the statistically processed fields. For instance, to create a 24 h accumulation (encoded in octets 37-40), we could use several 3 h accumulations, or 6 h accumulations, a mixture of the two, etc."
150,The reference time in octets 44-50 and the forecast time together define the beginning of the overall time interval.
151,The reference time in octets 41-47 and the forecast time together define the beginning of the overall time interval.
152,The reference time in octets 39-45 and the forecast time together define the beginning of the overall time interval.
153,The reference time in octets 36-42 and the forecast time together define the beginning of the overall time interval.
154,The reference time in octets 37-43 and the forecast time together define the beginning of the overall time interval.
155,The reference time in octets 34-40 and the forecast time together define the beginning of the overall time interval.
156,The reference time in octets 32-38 and the forecast time together define the beginning of the overall time interval.
157,"The reference and forecast times are successively set to their initial values plus or minus the increment, as defined by the type of time increment (one of octets (60+12(NC-1)), (73+12(NC-1)), (85+12(NC-1)), ...). For all but the innermost (last) time range, the next inner range is then processed using these reference and forecast times as the initial reference and forecast times."
158,"For most templates, details of the packing process are described in regulation 92.9.4. This template is only valid for the Consultative Committee for Space Data Systems Recommendation for Space Data System Standards, Lossless Data Compression, CCSDS 121.0-B-2, Blue Book, May 2012."