Coding and decoding of data

• US 7,950,588 B2
• Filed: 06/23/2005
• Issued: 05/31/2011
• Est. Priority Date: 06/28/2004
• Status: Active Grant

• Current Assignee: Anoto Group AB
• Original Assignee: Anoto Group AB
• Inventors: Björklund, Andreas
• Primary Examiner(s): Lee; Michael G
• Assistant Examiner(s): ELLIS, SUEZU Y
• Application Number:
  US11/630,038
• Publication Number:
  US 20070272750A1
• Time in Patent Office: 2,168 Days
• Field of Search: 235/494, 345/162, 382/201, 382/205
• US Class Current: 235/494
• CPC Class Codes: G06F 3/03545 Pens or stylus

Abstract

An information code has a positioning layer for coding position information and a data layer for coding arbitrary non-positional data. Both the positioning layer and the data layer may be formed by circularly shifted instances of a window sequence. A product may have information code. Further, the information code may be coded and decoded by using methods for coding and decoding and may be decoded by using an apparatus.

Claims

1. A method of storing data, comprising:

coding position information relating to a first dimension and a second dimension in a positioning layer;

coding arbitrary, non-positional data in a separate data layer; and

combining the positioning layer and the data layer to an information code to be arranged on a base, wherein both the position information and the data are coded by using window sequences, each window sequence having a property such that an arbitrary subsequence of predetermined length appears only once in the window sequence, and wherein the positioning layer and the data layer are superimposed on each other and overlapping elements from the positioning layer and the data layer are coded by a common code element.

2. The method as claimed in claim 1, wherein

coding the data in the data layer includes forming a matrix of instances of a window sequence, wherein the instances have circular shifts and wherein a size of the circular shifts depend on the data to be coded.

3. The method as claimed in claim 2, further comprising:

coding the data in the circular shifts of the instances.

4. The method as claimed in claim 2, further comprising:

coding at least one delimitation region in the data layer by circularly shifting the instances of the window sequence within the delimitation region by a predetermined fixed circular shift.

5. The method as claimed in claim 1, further wherein

coding the position information in the positioning layer includes forming a matrix of instances of a window sequence, wherein the instances have circular shifts and wherein a size of the circular shifts depend on the position information to be coded.

6. The method as claimed in claim 5, wherein the position information relating to the first dimension is coded in relative circular shifts between the instances.

7. The method as claimed in claim 5, further wherein

coding the position information relating to the first dimension includes coding a ruler window sequence in relative circular shifts between the instances of the positioning layer matrix.

8. The method as claimed in claim 5, further comprising:

circularly shifting said instances of the window sequence in the positioning layer matrix such that relative circular shifts between the instances belong to a predetermined subset of all possible relative circular shifts of the instances of the window sequence used for forming the positioning layer matrix.

9. The method as claimed in claim 1, further comprising:

coding a global information code parameter in the positioning layer such that it is decodable anywhere in the positioning layer.

10. The method as claimed in claim 9, further comprising:

coding the global information code parameter in relative circular shifts between the instances of the window sequence in the positioning layer matrix such that it is decodable anywhere in the positioning layer.

11. The method as claimed in claim 1, further comprising:

coding data in the data layer in data layer blocks of a predetermined size.

12. The method as claimed in claim 1, wherein the information code is a one-dimensional information code.

13. A product, comprising

a base;

and

an information code arranged on the base, the information code having

a positioning layer coding position information relating to a first dimension and a second dimension, and

a separate data layer coding arbitrary, non-positional data, wherein both the position information and the data are coded by using window sequences, each window sequence having a property such that an arbitrary subsequence of predetermined length appears only once in the window sequence, and wherein the positioning layer and the data layer are superimposed on each other and overlapping elements from the positioning layer and the data layer are coded by a common code element.

14. The product of claim 13, wherein the data in the data layer includes a matrix of instances of a window sequence, wherein the instances have circular shifts, and wherein a size of the circular shifts depend on the data.

15. The product of claim 14, wherein the circular shifts of the instances code the data in the data layer.

16. The product of claim 14, wherein the data layer includes at least one delimitation region, wherein the instances of the window sequence within the delimitation region are circularly shifted by a predetermined fixed circular shift.

17. The product of claim 13, wherein the positioning layer includes a matrix instances of a window sequence, wherein the instances have circular shifts and wherein a size of the circular shifts depend on the position information encoded by the positioning layer.

18. The product of claim 17, wherein relative circular shifts between the instances are configured to encode the position information relating to the first dimension.

19. The product of claim 17, wherein relative circular shifts between the instances of the positioning layer matrix are configured to encode a ruler window sequence configured to encode the position information relating to the first dimension.

20. The product of claim 17, wherein the instances of the window sequence are circularly shifted in the positioning layer matrix such that relative circular shifts between the instances belong to a predetermined subset of all possible relative circular shifts of the instances of the window sequence that form the positioning layer matrix.

21. The product of claim 13, wherein the positioning layer includes a global information code parameter that is coded such that it is decodable anywhere in the positioning layer.

22. The product of claim 21, wherein the global information code parameter is coded in relative circular shifts between the instances of the window sequence in the positioning layer matrix such that it is decodable anywhere in the positioning layer.

23. The product of claim 13, wherein the data in the data layer is coded in data layer blocks of a predetermined size.

24. The product of claim 13, wherein the information code is a one-dimensional information code.