TWI258741B - Multi-dimensional coding on quasi-close-packed lattices - Google Patents

Abstract

The present invention relates to a method and system for multi-dimensionally coding and/or decoding an information to/from a lattice structure representing bit positions of said coded information in at least two dimensions. Encoding and/or decoding is performed by using a close-packed lattice structure, preferably a quasi-hexagonal lattice structure. In particular, at least partial quasi-hexagonal clusters consisting of one central bit and a plurality of nearest neighboring bits can be defined, and a code constraint can be applied such that for each of said at least partial quasi-hexagonal clusters a predetermined minimum number of said nearest neighboring bits are of the same bit state as said central bit. Thereby, intersymbol interferences can be minimized at a high code efficiency. Furthermore, another code constraint can be applied such that for each of said at least partial quasi-hexagonal clusters a predetermined minimum number of said nearest neighboring bits are of the opposite bit state as said central bit. This constraint provides an advantageous high pass characteristic to avoid large areas of channel bits of the same type.

Description

1258741 (1)

BRIEF DESCRIPTION OF THE DRAWINGS (Description of the invention should be clarified: a technical field, prior art, content, embodiments, and drawings of the invention) Brief Description of the Invention The present invention relates to a method and system for performing multidimensional coding. Background of the invention

Users of the information age have access to explosive information through the widespread use of computers connected to the Internet. The cost of storing data is decreasing and the storage capacity of the same small device footprint is increasing, which is the main driving force of the information revolution. While meeting current storage needs, storage technologies must continue to evolve to catch up with rapidly increasing demand. However, magnetic and conventional optical data storage techniques (where individual bits are stored as different magnetic or optical changes on the surface of the recording medium) have reached their physical limits, and if they are exceeded, the individual bits will be too small or too difficult to store. Storing information in large amounts of media (not on its surface) provides an excellent alternative to high-capacity storage.

Holographic data storage is a large-scale storage method, although it has been thought for decades, recently due to the emergence of low-cost high-tech, the remarkable results of long-term research, and the advancement of holographic recording materials, etc. There are new developments in practical aspects. In holographic data storage, the entire information page is stored as an optical interference pattern in a thick photosensitive optical material. This is achieved by intersecting two uniform laser beams in the stored material, the first (called the object beam) containing the information to be stored, and the second (referred to as the reference beam) being a simple design to replicate as A simple calibration beam with a plane wavefront. The resulting optical interference pattern can cause chemistry and/or in the photosensitive medium

1258741 (2) Physical changes, the copying of the perturbation map is the absorption of the photosensitive medium, the refractive index, or the reversal of the thickness. When the stored interference grating (which is used in recording) is illuminated with one of two waves, a portion of this incident light is diffracted by the stored grating, whereby other waves can be reconstructed. The stored grating can be illuminated with interfering waves to reconstruct the object wave and vice versa. As for another three-dimensional or volumetric method, multi-layer, fluorescent card/magnetic (FMD/C) is the only breakthrough that solves the signal attenuation problems associated with the current CD (disc) and DVD (audio disc) retro-disc technology. As for CD or DVD, the data encoded on the FMD layer becomes a series of geometric features or volume marks on the substrate. Each layer can have 4.7 GB (billion bytes) (for example, a DVD), and with FMD/C technology, each storage layer is coated with a transparent phosphor material instead of a reflective metal layer of CD or DVD. When the laser beam hits the mark on the layer, it emits fluorescence, and the emitted light has a wavelength different from that of the incident laser light, slightly toward the red end of the spectrum, and is inconsistent in nature, and is currently inconsistent with optical devices. The reflected light is in contrast. The data mark does not affect the emitted light, so the laterally adjacent layers are undisturbed. In the disc reading system, the laser light is filtered out to detect only the information-containing fluorescent light, which reduces the effects of deviation from light and interference. In the above and other data storage systems (such as the conventional reflective optical disc technology), the purpose of 'encoding and signal processing' is to reduce the BER (bit error rate) to an important enough to achieve important characteristics such as high density and high data rate. This can be achieved by applying a physical component of the system to a point (the medium channel is error-free), and then introducing a modulation coding and signal processing design to reduce the BER to some level so that it can be corrected by the error. (Ecc) decoding process, and (4) (4) 1258741 The code of the set of such patterns of o and 1 pixel is called a low pass code, which is modulated by the modulation encoder 30 and the decoder 8 /decoding. This word variable code is limited to writing to a one-dimensional area (eg, information in the allowed pages of the holographic storage area has limited high spatial frequency content. Two-dimensional code with low-pass filtering features for these two new types of optical It is important to record the design's transmutation code, but two-dimensional (2_D) editing can also be an important project of the new path, which is closer to the conventional optical coding, such as the report reflection optical disc technology, in the use of cards or CDs. The two-dimensional area on the green two-dimensional pattern (labeled i) of the coherent refraction. It has been revealed that the encoding on the square lattice 'especially the size of the checkerboard code has been revealed in the following documents: w. Weeks, RE

Blahut, ftThe Capacity and Coding Gain of Certain Checkerboard

Codes'', IEEE Trans. Inform· Theory, Vol. 44, No. 3, 1998, pp 1 193-1203. Moreover, various checkerboard restrictions are revealed on the square lattice to achieve the low-pass feature' and thus the effect of inter-symbol interference (ISI) is reduced during channel bit reading and detection. However, for two-dimensional coding, such as the same-dimensional coding, in addition to coding on a square lattice (same as the conventional one), there are different coding restrictions and coding geometries for faster storage, thus achieving higher storage density. So there is still a need to improve coding efficiency' and also in multidimensional storage applications. In addition, in the 2-D coding, there is a bit detection, which is generally a homology signal. The reflection from a large part of the land is made by the D-L’s zero-order mirror part and from the large The bit part, that is, the 铳 part of the zero position (at the depth λ /4, where λ represents the wavelength of the radiation used for reading, and 3 - a J 全 are all the same. Therefore, the two-dimensional cannot be distinguished when detecting Level, in the practice of n 绝 仗 知 知 知 知 知 知 知 知 知 知 知 知 知 知 知 知 知

1258741 (5) will occur because the point diameter is always larger than the radial width of the point (or mark), and the refraction always occurs in the radial direction. The reflected beam outside the central aperture will thus lose some of its intensity due to refraction. In contrast, the above problem occurs in 2D coding because both of the behaviors are ideal in all focused lasers and other radiant points (which are incident on large points or large areas of land). mirror. Summary of invention

It is therefore an object of the present invention to provide an improved two dimensional or multidimensional coding design whereby error rates can be reduced due to intersymbol interference and/or large areas of the same (bipolar) bit type. This object can be achieved by the method of claim 1 of the patent application, such as the system of claim 2, and the record carrier of claim 32.

According to the present invention, in the use of a quasi-hexagon lattice structure for multi-dimensional coding, the advantage of such a quasi-hexagon lattice compared to a square lattice is that the coding efficiency and the intersymbol interference are closest to the nearest neighbor. The effects are cleverly combined. This quasi-hexagonal lattice means that the quasi-hexagonal theory can be arranged in a hexagonal arrangement, but a small lattice distortion with an ideal lattice will occur. For example, the angle between the base axes of the unit cells is not exactly equal to 60 degrees, and the quasi-hexagon lattice produces a bit configuration that is more like the intensity profile of the scanning laser points used in reading. The high packet density of the quasi-hexagon lattice structure provides high coding efficiency, and furthermore, the limitation on the preset number of next closest bits (which has the same bit state as the central bit) is intended to provide interference reduction in the coding spectrum. a low pass feature, while at the same time with respect to a preset number of next closest bits (which have a -10-

The substitution or additional limitation of the opposite bit state of the 1258741 is intended to provide a high-pass characteristic of the encoded spectrum to prevent large areas of the same bit state, so both of these limits can reduce the bit error rate. In addition, another code restriction can be applied with respect to the next closest bit (which has the same bit state as the central bit), according to which a preset number of azimuth consecutive bits are set to have the same as the central bit The bit state. Therefore, a very small mark size can be produced to simplify the writing process, such as when using a laser beam recorder (LBR) to record a main optical disc in a read only memory (ROM) application, and the laser beam is useful. There is not enough resolution to write a small mark size. Further, changing the field of view shape of the reading objective lens from a general rectangular shape to an equilateral hexagonal shape also improves the reading process of such a storage medium. Other advantages are as described in the attached patent application. BRIEF DESCRIPTION OF THE DRAWINGS Preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings in which: Figures 1A and 1B show schematic packing diagrams of a square lattice structure and a hexagonal lattice structure, respectively; Figures 2A to 2C show a hexagonal cluster of bit positions and a cluster of upper and lower boundaries of a preferred embodiment; FIG. 3 shows a schematic diagram to indicate a band two-dimensional code design; FIG. 4 shows a possible state change for two-dimensional code according to a preferred example; 5A and 5B show a prohibition pattern (Nnn=1) in the entire area of the belt according to the first preferred example; FIGS. 6A and 6B show the boundary area in the belt according to the first preferred example

1258741 (7) Prohibition pattern (Nnn=l); Figure 7 shows the graph indicating the upper and lower capacity limits for the first type of hexagonal lattice coding according to the first example; Figure 8 shows the graph indicating the upper and lower capacity limits. a second type of hexagonal lattice coding according to the first example; FIG. 9 shows a graph indicating upper and lower capacity limits for the third type of hexagonal lattice coding according to the first example;

Figure 1 Ο A and 10B are diagrams showing the relationship between eye height and user bit size characteristics in square and hexagonal lattice codes, respectively, according to the first preferred example. The graph of FIG. 11 is based on the first preferred example, showing the relationship between the eye height and the user bit size characteristics in the hexagonal lattice coding under different code constraints; FIG. 1 2 A and 1 2B respectively A forbidden pattern of the overall cluster and the boundary cluster according to the second preferred embodiment is shown; the graph of FIG. 13 shows the lower capacity limit for different limits according to the second preferred example; and the schematic of FIG. 14 shows the conventional data storage system Coding and processing elements; and Figure 1 5 A and 1 5 B show the field of view of the pick-up device when rectangular and equilateral hexagons are respectively displayed. DETAILED DESCRIPTION OF THE INVENTION A preferred embodiment of the present invention will now be described in terms of a taped two-dimensional code design in which a quasi-hexagonal lattice is used. -12-

1258741 In crystallography, the hexagonal lattice provides the highest packet score. For example, its packet score is 1/(: 〇8(30°)=1.155 is better than the square lattice, which is closest to the adjacent lattice point. Having the same distance a, the distance a of the latter can be determined by the content of the two-dimensional impulse response of the two-dimensional channel by holographic optical recording or fluorescent optical recording or conventional reflective optical recording (which It has the same refracting in two dimensions, and is used to write to the recording or storage medium 50.

Figure 1 A and 1 B show the packet structure of square lattice and hexagonal lattice respectively. For each lattice point, the square and hexagonal lattices respectively need two-dimensional areas of size a2 and a2cos (30°) respectively. 1 A and 1B show that the number of nearest neighbors is 6 for hexagonal lattices, but the number of square lattices is 4, so the first time you look at it, the use of hexagonal lattices is not Preferably, because the number of closest neighbors makes the inter-symbol interference become larger, the advantage of the hexagonal lattice compared to the square lattice is due to the coding efficiency and the intersymbol interference last closest neighbor. Consolidation of effects.

For other neighbors at longer distances, the hexagonal lattice has 6 next-to-right neighbors at distance A (the closest neighbor is 1), and 6 is closest to distance 2 Neighbors. As for the square lattice, at the distance of 4, the nearest neighbor is obtained, and at the distance 2, 4 times and the nearest neighbor can be obtained. Taking two-dimensional coding as an example, a full-size hexagonal cluster arranged in the entirety of a hexagonal lattice has seven positions or locations, one central location and six nearest neighbors. For simplicity, the noun hexagonal cluster as used herein may also refer to a quasi-hexagonal cluster of bits on a quasi-hexagon lattice. Only in the two-dimensional space -13-

1258741 Band boundary for band coding, partial size or boundary clustering will occur. 2A to 2C respectively show the clusters of the bit locations on the hexagonal lattice for the overall cluster, the lower boundary cluster and the upper border cluster, and the channel bits Xi at the location of the bits are numbered in the following manner.

In the overall cluster, the central bit has the number i = 0, and the 6 nearest neighbors are consecutively numbered i=l...6 in the order of their azimuth, incomplete or partial size boundaries at the band edge A cluster consists of only 5 bits or bit locations compared to a 7-bit or bit location of the overall cluster. The central bit also has the number i = 0, and the four azimuths are consecutively closest to the adjacent bit are consecutive numbers i = 1 "·4 〇 The following defines the new general code limit of the hexagonal lattice structure, which is the same Or the nearest neighbor of the central location of the partially sized hexagonal lattice is related. According to a first example, there are two purposes for limitation. First, it can implement a low-pass feature of the code spectrum, and second, it can implement a very small mark size to reduce the need for writing channels, especially, by Two parameters account for this limitation: (1) The minimum number of nearest neighbors (Νηη), which has the same type or bit state as the bit located at the central lattice location; and (2) the azimuth continuous most Close to the minimum number of neighbors (Nae), and KNac < Nnn. The parameter Nnn provides a low-pass feature that reduces the effects of interference between two-dimensional symbols, which can be easily seen by the fact that each element has six nearest neighbors, assuming a two-dimensional impulse response function (IRF) at a central location. There is a value of fO, and there is a value 最 at the nearest neighbor. Then if there are only Nnn (which is a very small number) of the nearest neighbors of the same type, then the wave can be implemented at a certain lattice location.

1258741 (9) Therefore, regardless of whether or not actual bits appear in adjacent code bands, the cluster limit can be satisfied at the band boundary, and the boundary limits can be stacked on top of each other without reaching the inverse limit, because the incomplete cluster for the boundary is also satisfied. limit.

Figure 3 shows that TF* — 7F is intended to refer to a two-dimensional code design without a band. The two-dimensional region is divided into several bands, one band is horizontally aligned, and consists of N-solid clusters. The coding is achieved in the horizontal direction, and becomes roughly one-dimensional, and the codeword does not cross the boundary of the band. The codeword is composed of Nr columns and heart rows according to the two-dimensional region, thereby constructing the band so as to be in the vertical direction. It does not reach the above limitation of crossing the boundary. In order to derive capacity and to define a fast code, the following finite state machine (FSM) must be derived, which drives the generation of a two-dimensional sequence. Since all of the limitations that currently occur are only related to the nearest neighbor, it is sufficient to consider the state based on two consecutive rows on the hexagonal lattice and cover all the columns of the strip. Then the number of such states is only 22~, and a complete row of channel bits can be output by transitioning from a known state to a next state. By definition, the last row of the first state is equal to the first row of the subsequent state. . Figure 4 shows the state "i" when Nr = 6, and a possible or allowed subsequent state ''j''. As can be seen from Figure 4, the last row of state "i" corresponds to the first row of state "j", in addition It meets the limits specified in Equations 2 through 4. An important point in deriving capacity and designing a two-dimensional channel or modulation code is the connection matrix D which is a square matrix of size 22~x22Nf with Nst possible states, which is limited by Nst^22Nf. The matrix element Dij of the connection matrix D is set to ''1'' when the state can have a state nj" corresponding to its subsequent state. All other matrix elements corresponding to the subsequent state are not set to '' Ο π, so if it meets -16 - 1258741 |_ (12) _______________________________________________________________________________________________________________________________________________---------------------------------------- -------------------------------------------------- ------------------------------------- --ΓΖΤ~__. - The following conditions allow the slave status "i '' becomes state" j " : 1) The last line of state "i" is equal to the first line of state "j"; 2) the state change does not reach the limit of the overall cluster (the overall limit), these limits are derived The only upper limit of capacity is to be considered; 3) The string of the band does not reach the inverse limit at the boundary of the cluster, so the boundary limit can be imposed so that the stack of the band can be executed regardless of the content of the adjacent band, for the export These limits are required for the lower limit of capacity. 5A and 5B show an example of a prohibited or disallowed pattern in the entire area of the band when Nnn=l, in this case, the state of 'Ni=state 1fj' will reach the limit of inverse Nnn=l, and the parameter X represents An irrelevant position, which can be set to any bit value ' and the encoding direction is the right side. Figures 6A and 6B show an example of a forbidden or disallowed pattern in the overall region of the band when (Nnn = 1), in this case, the slave state ' When f iπ becomes state " jπ , the opposite bit state will reach the limit of Νηη=1. Figures 7 through 9 show various calculations of code capacity at different widths of the cluster, i.e., the number of changed columns. The upper limit is defined by the capacity containing only the overall limit, which means that the band is not free, and defines the lower limit of the overall and boundary limits, that is, with the free string, which requires additional consumption and thus reduces the available capacity. Taking a single column (Nr = 1) of Nnn = 1 and Nac = 1 as an example (Fig. 7), the case of the lower limit corresponds to a one-dimensional length limit (RLL) code containing a length limit of d = 1. d=l The minimum length (2T) of the RLL code can only be implemented in the horizontal direction. When the increase in the lower limit capacity is marked from 1 to 2 (Nr=2), it is based on the fact that the level is relative to the band. The axis can also be implemented with a very small length limit (2T) in the tilt direction at an angle of 60 degrees to 120 degrees. 1258741 Figure 8 shows the relationship between capacity and bandwidth characteristics when Nnn=2, Nac=l, and Figure 9 shows the relationship between capacity and bandwidth characteristics when Nnn=2, Nac=2, in these examples, the same type The minimum number or state closest to the neighbor is equal to 2, and when Nae=l, the 2 nearest neighbors of the same type do not have to be in continuous azimuth, and when Nae=2, the 2 closest phases of the same type The neighbors do not have to be in a continuous azimuth. As can be seen from Figures 8 and 9, higher limits reduce the upper and lower limits. Figure 1 Ο A and 1 Ο B shows a numerical calculation diagram at the capacity corresponding to the lower limits of Figures 8 and 9 to indicate the relationship between eye height and user bit size characteristics, which is in the form of a series such as Nr = 8 In the case of coding, the dotted line applies to the hexagonal lattice and the solid line refers to the conventional square lattice, assuming that the impulse response function is a two-dimensional Gaussian function (in two-dimensional normalization), as a reference, the central branch value display of the two-dimensional IRF 10A and 10B are taken as the upper constant level. Note that the important practical range includes the positive eye height, so the two-dimensional channel is actually useless at zero eye height and above (similar to the cutoff frequency of a one-dimensional channel), so as expected, on a hexagonal lattice The eye height can be improved by two-dimensional coding, and additional improvements can be achieved by increasing the azimuth of the same state continuously to the nearest neighbor. The graph in Figure 1 shows the relationship between eye height and user bit size characteristics only in hexagonal lattice coding and Nnn=0, l, 2. The coding gain achieved by eye height is an obvious increase in this limit. Trends can be achieved by increasing the low-pass characteristics of the 2D channel code. The limitation of writing to the channel is characterized by the minimum two-dimensional mark size to be written. Obviously, limiting Nnn=2 and Nae=2 in this example is the most important. At six-18- (16) 1258741 ----------------------------------------- ----------- _________ —— Combine the Nnn and Mnn restrictions of the real drop m Aj_ —— , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , σ wt. The 8 to 9 mapped code is used for a 3-column band with a limit of Νηη = 1 for the whole process and for the two boundaries, and Μηη=1 for the whole and for only one boundary. In addition, a code with a 1 1 to 1 2 mapping can be used for a 3-column band with a limit of Nnn=1 to identify the φ state in the whole and two boundaries, and Μηη=1 for the whole but Not for any boundaries. In the above preferred examples, the same restrictions are imposed on _, a bit of grievance or type such as mark and non-mark or point and land, and the same restrictions, depending on the characteristics of the channel. It is preferred to impose an asymmetrical limit, ie different limits for the two types or positions. Moreover, the boundary cluster is not in the single-band boundary, but in the boundary of the 2D region. For example, it is surrounded by a certain protection zone. In the soil 1 position 2 instead of the point bit, it can quickly have (10) less 艮Because the guaranty band includes a larger land area. In addition, the direction selected for the two-dimensional band is the [100] direction or the [110] direction of the hexagonal lattice. When 10,000 fields are sorted, the child field is the area information on the green media as the point or corpse#, the square 5 ^ _ contains the stored 戸 as the point or 'Ji in at least two-dimensional (2D green), 〆 in six The angular dot matrix can be used to display the domain storage density using a quasi-close to the packet lattice. In addition, this can also be used to enhance the reading of this type of today's fire, especially for the configuration of the pick-up device, which can be a reading of the umbrella spot. The 1 elementary device includes an objective lens to image the stored data. On the image surface, a detection device is arranged in the image plane to detect the read data. The circular view of the objective lens ^ + face machine field is not fast to use because in fact the detection device only uses the part of the circular image plane, so Figure 15 shows the system according to the rectangular coordinate system in the square station, τ order When the field is 0, it is used for 2D reading, especially the circular objective field of the image plane - 21 - 158, 871 - _ Portuguese (17) reading objective configuration. A square area VF corresponding to the detection device is displayed in the field of view VF, as defined by the detection component configuration in the image plane.

As can be seen from Fig. 15A, in addition to the low area storage density, the square field of view VFsq of the detecting means uses only about 64% of the 2/7 inch of the circular field of view VF of the objective lens. However, if the data field D is located in the quasi-hexagon lattice structure introduced, the data storage density will increase, but it is impossible to read because the square field of view VFsq of the detecting device does not match the quasi-hexagon lattice of the data field. This, as a result, makes reading difficult and thus results in a low read rate.

Thus, in Fig. 15B, the hexagonal field of view VFhex of the detecting means is introduced, which is in the circular field of view VF of the objective lens, which in this example is an equilateral hexagon. This results in a high data storage density, an increase of about 15% compared to a square lattice, and a high read rate which is due to the more efficient use of the field of view VF of the objective lens. In particular, it is about 83% of a part of 3cos30° /7Γ which can use the field of view VF. That is, a total improvement of about 30% and about 50% is added, which combines the following two effects: a quasi-hexagonal lattice configuration of the data field and a hexagonal field of view VFhex of the detecting device. In addition, seamless stitching of these equilateral hexagonal fields of view VFhex may be obtained during reading. Note that a very small data rate can only be achieved when reading is performed along one of these possible directions (defined by the [100], [010] or [110] lattice direction of the quasi-hexagon lattice structure). In these cases, a large spatial frequency, field (or point) and a little plane (which is only filled in) can be provided when a little plane (belonging to type (100), (010) or (110)) is filled with points. There is a land area (or land bit) alternating, of course, this highest spatial frequency must be lower than the reading optics of the pickup device-22-

1258741 Cutoff frequency. The most obvious way to perform 2D data structure replication in the field of view of the detection device is by means of coherent illumination of the appropriate area on the recording medium (which contains the data field), by which these regions can be scanned continuously or step by step, For example, the data field in the image plane of the optical disc moves through the read detector array, so the data of a special domain must be collected by different detector segments at different time steps in order to obtain sufficient light energy from the special domain. . In the second example, the data field is fixed relative to the detector array at a certain time, wherein the data signals in the field of view can be added or integrated separately, and after reading the data field of a special field of view, the picking device must be moved to Adjacent fields of view, etc. However, in addition to fluorescent reading, the coherent illumination has a cutoff frequency that is half the cutoff frequency of the non-coherent illumination. By non-coherent illumination, individual dot arrays, which can be produced by a grating in the illumination portion of the pick-up device, are scanned along one side of the hexagonal structure. Note that adjacent points do not overlap, so the track pitch is much smaller than the distance between consecutive points. In order to simultaneously read adjacent tracks, the points are inclined with respect to the track, and the illumination point in the field of view of the objective lens of the pick-up device can be It is distributed in various ways, but the maximum density can be obtained for the part on the quasi-hexagon lattice. Note that the above-described hexagonal dot matrix multi-dimensional coding can be used in any data storage system, such as a two-dimensional optical storage area: holographic optical recording, calender optical recording, page-oriented optical recording, conventional reflective optics The storage area (but encoded in two dimensions), etc., or any other storage system in which high and/or low pass code characteristics may be desired. In particular, the invention is also intended to cover a record carrier, such as a compact disc, for use in such a data storage system, on which -23

Claims (1)

1258741 Picking up, applying for patent scope 1 · A method for multidimensionally encoding information into a dot matrix structure or multi-dimensionally decoding information from the lattice structure, the lattice structure representing a bit position of the encoded information in at least two dimensions, The quasi-close-to-packet lattice structure according to one of the quasi-hexagon lattices is used for the multi-dimensional coding and multi-dimensional decoding, and the method comprises the following steps: a) defining at least a portion of a quasi-hexagon cluster consisting of a central bit and a plurality of nearest neighbors; and b) applying a first code constraint, for each of the at least partial quasi-hexagon clusters, A very small number of the nearest neighbors is in the same bit state as the central bit. 2. The method of claim 1, wherein the predetermined minimum number of adjacent neighbors is less than or equal to three. 3. If the method of claim 1 or 2 is applied, it also includes applying a second The code is constrained such that one of the azimuthal consecutive bits closest to the adjacent bit presets a minimum number of steps in the same bit state as the central bit. 4. The method of claim 3, wherein the predetermined number of consecutively adjacent abutting neighbors is less than or equal to a predetermined minimum number of the first code limits. 5) The method of claim 1 or 2, further comprising applying a third code limit, preset a minimum number of the nearest neighbors and the central bit for each of the at least partial quasi-hexagon clusters The step of the opposite bit state. The method of claim 1 or 2, wherein the encoding and decoding is one-band two-dimensional encoding and decoding, and the at least partially quasi-hexagon cluster comprises: an overall cluster having six nearest neighbors The element, and a boundary cluster have 4 nearest neighbors and are located at the edge of a coded band along which the encoding and decoding are performed. 7. The method of claim 6, wherein the code strip is located in the [100] or [110] direction of the quasi-hexagon lattice structure. 8. The method of claim 1 or 2, wherein the different code limits are imposed depending on the bit state of the central bit of the quasi-hexagonal portion of the cluster under consideration. 9. The method of claim 1 or 2 wherein the pick-up device has a hexagonal field of view. 10. The method of claim 9, wherein the hexagon is an equilateral hexagon. 11. The method of claim 9, wherein the reading of the stored data is performed by using a detecting device configured to generate a signal corresponding to the stored data in an image plane of the picking device. 12. The method of claim 1, wherein the reading is performed with a continuous movement of the pick-up device on a lattice structure containing the stored material. 1. The method of claim 12, wherein the stored data is detected by collecting detection signals of different segments of the detecting device at different time steps. 14 · If the method of claim 9 is included, the storage information is included 1258741 The dot matrix ί' 1 5. If the application will be individual / 1 6. If the application data is picked up 彳 1 7. The dimensional decoding of the two-dimensional lattice in the structure a) the fixed and complex b) the shaped cluster The metasystem 18. If the application is pre-determined, the reading is performed by applying a stepwise movement of the pick-up device. The method of claim 14, wherein the stored data is detected by adding signals of the seek segments at a certain time. The method of claim 12, wherein the moving is performed along a direction [100] or [110] containing the quasi-hexagon lattice structure. Multidimensionally encoding information into a dot matrix structure or a method of multidimensional decoding from the dot matrix information, the dot matrix structure being represented at at least a bit position of the encoded information, wherein the quasi-hexagonal proximity to the packet lattice structure is used according to a quasi-hexagonal shape In the multidimensional coding, the method comprises the following steps: at least partially quasi-hexagon clusters, wherein a central bit consists of the nearest neighbors; and Restricted by a first code, for each of the at least partial quasi-hexagons, a minimum number of the nearest neighbors and the central opposite bit state are preset. The method of clause 17 of the patent, wherein the closest adjacent position is a very small number of ones. The method of claim 17 or 18, further comprising applying a first system, wherein for each of the at least partially quasi-hexagon clusters, the closest neighboring cell is the same as the central bit system The steps. The method of claim 17 or claim 18, wherein the encoding and decoding is one-band two-dimensional encoding and decoding, and the at least partially quasi-hexagon The 1258741 cluster includes: an overall cluster having six nearest neighbors, and a boundary cluster having four nearest neighbors located at the edge of a coded band along which the encoding and decoding are performed. 2 1 The method of claim 20, wherein the code strip is located in the [100] or [110] direction of the quasi-hexagon lattice structure. 22. The method of claim 17 or claim 18 wherein different code restrictions are imposed depending on the bit state of the central bit of the quasi-hexagonal cluster in question. 23. The method of claim 17 or 18, wherein the field of view of a pick-up device has a hexagonal shape. 24. The method of claim 23, wherein the hexagon is an equilateral hexagon. 25. The method of claim 23, wherein the reading of the stored data is performed by using a detecting device configured to generate a signal corresponding to the stored data in an image plane of the picking device. 26. The method of claim 25, wherein the reading is performed on the lattice structure containing the stored data by the continuous movement of the picking device. 27. The method of claim 26, wherein The stored data is detected by collecting detection signals of different segments of the detecting device at different time steps. 28. The method of claim 23, wherein the reading is performed by stepping movement of the pick-up device on a lattice structure containing the stored data. 29, as claimed in claim 28 The method of detecting the stored data by adding signals of the individual detection segments at a certain time. 30. The method of claim 26, wherein the movement of the pick-up device is performed along a [100] or [110] direction of the quasi-hexagonal lattice structure containing the stored data. 3 1. A system for multidimensionally encoding information into a dot matrix structure or multidimensionally decoding information from the lattice structure, the lattice structure representing a bit position of the encoded information in at least two dimensions, the system including encoding Apparatus (30) and decoding means (80) configured to perform encoding and decoding, respectively, by using a quasi-hexagon lattice structure to define at least a portion of a quasi-hexagon cluster, wherein a central bit and a plurality of closest Adjacent bit composition 5 and a code limit are imposed, for each of the at least partially quasi-hexagon clusters, a predetermined minimum number of the nearest neighbors and the central bit are in the same bit state. 32. The system of claim 31, wherein the system is a data storage system. 33. The system of claim 31, wherein the pick-up device has a hexagonal shape. 34. The system of claim 33, wherein the hexagon is an equilateral hexagon. 3. The system of claim 31, wherein the reading of the stored data is performed by detecting a plane in one of the image planes of the pick-up device 3 6. The system of claim 31 Which is on the storage medium The reading is performed by continuous movement of the pickup device. 1258741 37. The system of claim 36, wherein the stored data is read by collecting detection signals of different detection segments at different time steps. 3 8. The system of claim 31, wherein the reading is performed by a step movement of the pick-up device. 39. The system of claim 38, wherein the stored data is read by adding the signals of the individual detection segments at a certain time. 40. A system for multidimensionally encoding information into a dot matrix structure or multidimensionally decoding information from the lattice structure, the lattice structure representing a bit position of the encoded information in at least two dimensions 'The system includes an encoding device (30) and decoding means (80) configured to perform encoding and decoding, respectively, by using a quasi-hexagon lattice structure to define at least a portion of a quasi-hexagon cluster, wherein a central bit and a plurality of closest phases The adjacent bit composition, and a code limit is imposed, for each of the at least partially quasi-hexagon clusters, a predetermined minimum number of the nearest neighbors and the central bit are opposite bit states. 41. The system of claim 40, wherein the system is a data storage system. 42. The system of claim 40, wherein the pick-up device has a hexagonal shape. 43. The system of claim 42, wherein the hexagon is an equilateral hexagon. 44. The system of claim 40, wherein the reading of the stored data is performed by detecting a plane in one of the image planes of the pick-up device. 1258741 45. If you apply for a patented device, the pick-up device 46. If the patent application process step is different, 47. If the patent application is stepped by mobile, it will be executed. 4. If the patent application model is to be individually detected, 49. A record carrier, benefit range No. 1, 2, 50. If you apply for a patent system CD (50). The system of item 40, wherein the I purchase is performed by continuous movement on a storage medium. The system of item 45, wherein the stored data is read by detecting the detected signals at different times. The system of item 40, wherein the reading is performed by the picking device. A system according to item 47, wherein the stored data is read by adding signals at a certain time. A message is written thereon, wherein the information is encoded by a multi-coded method such as applying for a specific 17, 18, 31 or 40 item. Record carrier of item 49, wherein the record carrier