WO2005031981A1

WO2005031981A1 - Code generation program, code generation method, code generation device, content use program, content use method, and content use device

Info

Publication number: WO2005031981A1
Application number: PCT/JP2003/012251
Authority: WO
Inventors: Takahito Iida; Nobuyuki Kinoshita; Makoto Yoshioka; Yasuhiro Nakanishi; Hideo Ogata; Mika Onishi Neergaard
Original assignee: Melodies & Memories Global Limited
Priority date: 2003-09-25
Filing date: 2003-09-25
Publication date: 2005-04-07
Also published as: AU2003266615A1; JPWO2005031981A1

Abstract

A code generation method includes: a selection step for selecting a plurality of consent information on objects to be encoded from a set of consent information in an item table having consent information arranged in a matrix by inputting an item number (row number) and an item value number (column number) in the item table; and a code generation step for generating a code compressed by a predetermined algorithm (such as Chinese remainder theorem) from a group of the item numbers and item value numbers corresponding to the selected plurality of consent information.

Description

Code generation program, code generation method, code generation device, content usage program, content usage method, and content usage device

The present invention relates to a code generation program, a code generation method, a code generation device, a content usage program, a content usage method, and a content usage device suitable for coding predetermined information and using content based on the code. In particular, the present invention relates to a code generation program, a code generation method, a code generation device, a content use program, a content use method, and a content use device which can be written by improving coding efficiency. Background art

Conventionally, a technique of generating a code from a plurality of pieces of predetermined information has been widely used. FIG. 10 is a diagram for explaining conventional code generation. In the figure, information X, information Y and information Z are information to be coded (coded information). Code C is a code of information X, information Y, and information Z.

In code C, X bits, y bits, and z bits are fixedly allocated in correspondence with information X, information Y, and information Z. Thus, code C is X + y + _Z bits (fixed).

Then, the information is coded into an X-bit partial code C x. The information Y is also coded to be a y-bit partial code C y. Similarly, information Z is also coded, and is set as a z-bit partial code Cz. As a result, a code C including the partial code Cx, the partial code Cy, and the partial code Cz is generated.

Patent Literature 1 Japanese Patent Publication No. 2000--1 7 2 8 0 2

By the way, as described above, in the conventional code generation method, information X, information Y By coding the information and the information Z, the information can be compressed.

Nowadays, there is a demand for more efficient coding. However, in the conventional code generation method, since the data length (x + y + z bits) of the generated code C is fixed, it is not possible to sufficiently meet the demands for power and power. was there.

The present invention has been made in view of the above, and has a code generation program, a code generation method, a code generation device, a content use opening timer, a content use method, and a content use device capable of improving coding efficiency. The purpose is to provide. Disclosure of the invention

In order to achieve the above object, the present invention provides a selection step of selecting a plurality of pieces of information to be coded from a set of information by inputting a first number and a second number, A code generating step of generating a code compressed by a predetermined algorithm from a first number group and a second number group respectively corresponding thereto; and a code generation program for causing a computer to execute.

Further, the present invention provides a selection step of selecting a plurality of pieces of information to be encoded from a set of information by inputting a first number and a second number, and a first step corresponding to each of the plurality of pieces of selected information. And a code generation step of generating a code compressed by a predetermined algorithm from the number group of the second number. Also, the present invention provides a selection means for selecting a plurality of pieces of information to be coded from a set of information by inputting a first number and a second number, and a first means corresponding to each of the plurality of pieces of selected information. And code generation means for generating a code compressed by a predetermined algorithm from the group of the second number and the second number. According to the powerful invention, by inputting the first number and the second number, a predetermined number is obtained from a group of the first number and the second number corresponding to a plurality of pieces of information selected from the collection of information. To generate code compressed by the algorithm of Therefore, the coding efficiency can be improved.

Further, the present invention is a content use program for causing a computer to execute a control step of controlling use of content based on a code generated by the code generation method.

Further, the present invention is characterized by including a control step of controlling the use of the content based on the code generated by the code generation method.

Further, the present invention is characterized by comprising a control means for controlling the use of contents based on the code generated by the code generation method.

According to the invention, it is possible to increase the efficiency of coding and the efficiency of use of contents. Brief Description of Drawings

FIG. 1 is a block diagram showing a configuration of an embodiment according to the present invention, FIG. 2 is a diagram showing an item table 500 used in the same embodiment, and FIG. FIG. 4 is a diagram illustrating input of an item number and an item value number in the same embodiment. FIG. 4 is a flowchart illustrating the operation of the code generation device 100 illustrated in FIG. FIG. 6 is a flowchart for explaining the operation of the content use device 400 shown in FIG. 1, FIG. 6 is a diagram for explaining a template 51 OA in the same embodiment, and FIG. FIG. 8 is a diagram illustrating a template 510B according to the same embodiment, FIG. 8 is a diagram illustrating a template 5100C according to the same embodiment, and FIG. 9 is a diagram illustrating the template 5100 according to the same embodiment. FIG. 10 is a block diagram showing a configuration of a modification, and FIG. Is a diagram illustrating a conventional code generation method. BEST MODE FOR CARRYING OUT THE INVENTION

Hereinafter, an embodiment of the present invention will be described in detail with reference to the drawings. FIG. 1 is a block diagram showing a configuration of an embodiment according to the present invention. In the figure, for example, content (music content, video content, data A code generation system for generating a code for controlling the use of content, program contents, and the like, and a code generation system for using the content based on the code is shown.

This code generation / content utilization system is composed of a code generation device 100, a network 200, a content distribution device 300, and a content utilization device 400.

The code generation device 100 is a device that efficiently generates a code from a plurality of pieces of permission information regarding the use of content based on a predetermined algorithm (for example, the Chinese Remainder Theorem).

In the code generator 100, the input unit 101 is an input device such as a keyboard and a mouse, and is used for inputting various kinds of information necessary for code generation. The display unit 102 is an LCD (Liquid Crystal Display), a CRT (Cathode Ray Tube), or the like, and displays various types of information necessary for code generation.

The control unit 103 controls code generation. Details of the operation of the control unit 103 will be described later. The item table storage unit 104 stores the item table 500 shown in FIG.

The item table 500 is a table in which a plurality of pieces of permission information as coded information are represented by a two-dimensional matrix. The license information indicates the license conditions (contract) for using the content.

In the item table 500, the item names represent items related to the license of the content (“public classification”, “purpose class”, “charging class”, “territory class”). The item number is a number associated with each item name, and is a row number of the matrix. Each item has multiple choices. For example, there are four choices for “public category”: “do not select”, “open permit”, “closed permit”, and “other”.

In addition, there are six options in the “Objective category”: “Not selected”, “Commercial license”, “Public license”, “Non-commercial license”, “Promotion license” and “Other”. Exists.

In addition, there are four options in the “charging category”: “not selected”, “free”, “paid”, and “other”. Also, there are six options in the “territory category”: “none”, “Japan”, “Korea”, “China”, “US” and “EU”. The item value number is a number associated with each option, and is a column number of the matrix. In this item value number, the numbers are assigned so that any two are mutually prime by applying the Chinese Remainder Theorem described later.

Here, each permission information in the item table 500 is uniquely specified by the item number and the item value. In the example shown in FIG. 3, shaded portions are uniquely specified permission information 500a 500b, 500c, and 500d.

For example, the license information 500a is a license information with a content of “Do not select“ public classification ”.” This license information 500a is composed of an item number (= 11) and an item value number (= 0). It is uniquely specified by the cross point.

Also, the license information 500b is the license information having the content “the purpose category is“ commercial license ”.” The license information 500b has an item number (= 13) and an item value number (= It is uniquely specified by the cross point with 1).

In addition, the license information 500c is a license information having a content of "charge category" is "paid." The license information 500c has an item number (= 17) and an item value number '(2). Is uniquely specified by the cross point.

Also, the license information 500d is the license information with the content “The territory category is“ Japan. ”The license information 500d has an item number (= 19) and an item value number (= It is uniquely specified by the cross point with 1).

Returning to FIG. 1, the code generation unit 105 generates a code from the item number and the item value number (license information) selected in the item table 500 (see FIG. 3) based on, for example, the Chinese Remainder Theorem. . The generated code is used in the content use device 400 to control the use of the content 310. The details of the operation of the code generation unit 105 will be described later. The code storage unit 106 stores the code generated by the code generation unit 105. The communication unit 107 controls communication according to a predetermined communication protocol.

The content distribution device 300 distributes the content 310 to the content use device 400 via the network 200. The content 310 is music content, video content, data content, program content, and the like, and is used (reproduced, executed, etc.) by the content use device 400.

The content use device 400 is a device for using the content 310 based on the code generated by the code generation device 100. In the content use device 400, the input unit 401 is an input device such as a keyboard and a mouse, and is used for inputting various information necessary for using the content.

The display unit 402 is an LCD, a CRT, or the like, and displays various information necessary for using the content.

The control unit 403 controls the use of the content. Details of the operation of the control unit 403 will be described later. The code storage unit 404 stores the code generated by the code generation device 100. The item table storage unit 400 stores the item table 500 shown in FIG.

That is, the same item table 500 is stored in both the item table storage unit 405 of the content use device 400 and the item table storage unit 104 of the code generation device 100. .

The content storage unit 406 stores the content 310 distributed from the content distribution device 300 via the network 200. The content output unit 407 outputs the content whose use is controlled by the code to a large display or an audio device. The communication unit 408 controls communication according to a predetermined communication protocol.

Next, the operation of the embodiment will be described with reference to the flowcharts shown in FIG. 4 and FIG. FIG. 4 is a flowchart for explaining the operation of the code generator 100 shown in FIG. FIG. 5 is a flowchart for explaining the operation of the content using device 400 shown in FIG. At step SA1 shown in FIG. 4, the control unit 103 of the code generation device 100 causes the display unit 102 to display the item table 500 shown in FIG. In step SA2, the control unit 103 causes the operator to input an item number and an item value number corresponding to the license information to be encoded.

Here, the license information to be coded is, for example, the license information 500a, the license information 500b, the license information 500c, and the license information 500d shown in FIG.

In step SA3, the control unit 103 determines whether or not the input of the item number and the item value number has been completed. In this case, the determination result is set to "No", and the process of step SA2 is performed. Execute

Then, using the input unit 101, the operator uses the input unit 101 to set the item numbers and the corresponding license information 500a, the license information 500b, the license information 500c, and the license information 500d, respectively. Enter the item value number as follows:

(Item number) (item value number)

License information 5 0 0 a → 1 1 0

License information 5 0 0b → 1 3

License information 5 0 0 c → 1 7 2

License information 5 0 0 d → 1 9

The control unit 103 sets the plurality of input item numbers and item value numbers to the profile 501 shown in FIG.

When the above input is completed, the control unit 103 sets the determination result of step SA 3 to “Yes J.” At step SA 4, the code generation unit 105 determines the item number based on the Chinese remainder theorem. Generate a code from the data and the item value number (profile 501: see Fig. 3).

Here, Chinese Remainder Theorem, when any two also relatively prime natural numbers m doctor · · 'm _r is given, the following simultaneous congruence

χ≡ V ₂ mod (N ₂ ) x≡V _n mod (N _n )

There exists a solution, and one solution is X. Then the whole solution is given by

{x. + nTTiiiii I n Z

For example, if the problem is to find an integer that is 2 divided by 3, 2 divided by 5, 3 divided by 7, and 2 divided by 7, 23 is one solution from the Chinese Remainder Theorem. When this Chinese Remainder Theorem is applied to code generation, if the code is the dividend and the item number is the divisor, and the item value number is the remainder, the `` multiple item numbers and item value numbers entered in step SA 2 The integer that specifies is determined. " In one embodiment, the integer is treated as a code.

Applying the Chinese Remainder Theorem to one embodiment, the following simultaneous congruence is obtained. Codeo V mod (N _x )

Code ≡V ₂ mod (N ₂ )

Co ≡V _n mod (N _n )

In the simultaneous _{congruence, V v 2, · · ·} , v n are (the same favorable profile it le 501, 11, 13, 17, 19) item number is. N ₂ ,..., N _n are item value numbers (0, 1, 2, 1 in profile 501 in FIG. 3). In other words, when applying the Chinese remainder theorem to each item number and item value number represented in profile 501 (see Fig. 3), it can be divided by 11, divided by 0, divided by 13, divided by 1, divided by 17, and divided by 17 to 2 The remainder, which is divided by 19 and left over, is 495 (see Figure 3). That is, this 495 is the code. Here, when the Chinese Remainder Theorem is not applied, if the code is a sequence of item numbers and item value numbers in the profile 501 (see FIG. 3), then “1 1 0 1 3 1 7 2 1 9 1 ”is the code.

On the other hand, when the Chinese Remainder Theorem is applied, “4 95” is used as the code, and the coding efficiency (compression rate) can be increased. In the above, the code S is represented by a decimal number S, in fact, it is represented by a binary code (binary number). In step S A5, the control unit 103 stores the code (“495”) generated by the code generation unit 105 in the code storage unit 106, and ends a series of processing. On the other hand, in the content use device 400, in step SB1 shown in FIG. 5, the control unit 403 accesses the code generation device 100 via the network 200, and Get the generated code ("4 95"). In step SB2, the control unit 403 stores the acquired code (“495”) in the code storage unit 404.

In step SB3, the control unit 403 accesses the content distribution device 300 via the network 200 and acquires the content 310. In step SB4, the control unit 403 stores the acquired content 310 in the content storage unit 406.

In step SB5, the control unit 403 obtains the item number and the item value number (profile 501: see FIG. 3) from the code (“495”) by the reverse logic in step SA4. Ask. In step SB6, the control unit 403 stores the item number and the item value number obtained in step SB5 in the item table 500 (see FIG. 2) stored in the item table storage unit 405. Apply and get license information.

In this case, the control unit 403 acquires, as the license information, the license information 500a, the license information 500b, the license information 500c, and the license information 500d shown in FIG. . In step SB7, the control unit 403 controls the use of the content 310 stored in the content storage unit 406 based on each license information acquired in step SB6. In the above-described embodiment, the case of the Chinese remainder theorem as a code generation algorithm has been described, but another algorithm may be applied. For example, in one embodiment, the code may be generated based on the prime factorization theorem. The prime factorization theorem states that "composite numbers can be decomposed into products of prime numbers, and the result of that decomposition is simply uniform."

That is, if a = p ^α q 0 r ^γ ··· is a decomposition into prime powers, all divisors of a are

p ^x qyr ^ζ

, 0≤χ≤α, 0≤γ≤β, 0≤ ζ≤γ, ··· ·

Here, when the above factorization factorization theorem is applied to one embodiment, if ひ, i3, γ, • 'are each item value numbers, and p, q, r, ·' are each item numbers, The code is uniquely identified.

Specifically, if the item value numbers are 5, 3, and 3, and the item numbers are 2, 3, and 5, the code becomes 1 8 4 (2 ^Λ 5 + 3 ^Λ 3 + 5 ^Λ 3).

Here, when the prime factorization theorem is not applied, if the code is a sequence of item numbers and item value numbers in profile 501 (see Fig. 3), then “2 5 3 3 5 3” becomes Code.

On the other hand, when the prime factorization theorem is applied, it is regarded as “184” power S-code, and the coding efficiency (compression rate) can be increased. In the above description, the code is represented by a decimal number, but it is actually represented by a binary code (binary number).

Also, in one embodiment, in step SA2 shown in FIG. 4, an example in which a plurality of item numbers and item value numbers are input in association with all license information has been described. As shown in Fig. 8 and Fig. 8, templates 5110A and 510 B and 5100C may be prepared in the code generating apparatus 100, and any one of the templates may be selected to reduce the input load.

In the template 51OA shown in FIG. 6, the item number and the item value number are set as defaults for the permission information in the shaded portion of the item table 500 in FIG. Therefore, the operator does not need to input the default permission information. The same applies to the template 5 10 B and the template 5 10 C shown in FIGS. 7 and 8.

As described above, according to one embodiment, by inputting the item number (first number) and the item value number (second number) in the item table 500 (see FIG. 3), A code compressed by a predetermined algorithm is generated from a group of item numbers and item value numbers respectively corresponding to a plurality of pieces of license information selected from a set of license information, thereby improving coding efficiency. be able to.

Further, according to one embodiment, as described with reference to FIGS. 6 to 8, the template 51 in which the item number and the item value number are set to the default in accordance with the selection pattern. Since a plurality of pieces of permission information to be encoded are selected using 0A to 5110C, the burden on input can be reduced.

Further, according to the embodiment, the efficiency of coding and the efficiency of content use can be improved.

An embodiment according to the present invention has been described above in detail with reference to the drawings. However, a specific configuration example is not limited to this embodiment, and does not depart from the gist of the present invention. Even a change in the design of the range is included in the present invention.

For example, in the above-described embodiment, a computer program for realizing each function of the code generation device 100 and the content use device 400 shown in FIG. Each function can be realized by recording on a possible recording medium 600 and causing the computer 500 to read and execute the program recorded on the recording medium 600.

The computer 500 has a CPU (Central Processing) that executes the above program. Unit) 510, input device such as keyboard and mouse 520, ROM (Read Only Memory) 530 for storing various data, and RAM (Random Access Memory) 540 for storing calculation parameters etc. 0, a reading device 550 for reading a program from the recording medium 600, and an output device 560 such as a display or a printer.

The CPU 510 realizes the above-described functions by reading the program recorded on the recording medium 600 via the reading device 550 and executing the program. Note that examples of the recording medium 600 include an optical disk, a flexible disk, and a hard disk.

As described above, according to the present invention, by inputting the first number and the second number, the first number and the second number respectively corresponding to a plurality of pieces of information selected from the set of information. Since a code compressed by a predetermined algorithm is generated from a group of numbers, the coding efficiency can be improved. '

Further, according to the present invention, a plurality of pieces of information to be encoded are selected using a template in which the first number and the second number are defaulted in accordance with the selection pattern. This has the effect of reducing the burden on the user.

Further, according to the present invention, there is an effect that the efficiency of coding and the efficiency of use of content can be improved. Industrial applicability

As described above, the code generation program, the code generation method, the code generation device, the content use program, the content use method, and the content use device according to the present invention are used for coding information and using code-based content. And useful.

Claims

The scope of the claims

1. a selection step of selecting a plurality of pieces of information to be encoded from a set of information by inputting a first number and a second number;

A code generation step of generating a code compressed by a predetermined algorithm from the first number and the second number corresponding to the plurality of pieces of selected information,

Code generation program for causing a computer to execute.

2. The set of information is arranged in a matrix, the first number is a number for identifying a row of Matrix, and the second number is for identifying a column of the matrix. 2. The code generation program according to claim 1, wherein the code generation number is a number for the code generation.

3. In the selecting step, a plurality of pieces of the information to be coded are selected using a template in which the first number and the second number are set as defaults in correspondence with a selection pattern. Code generation program according to the first paragraph of the scope.

4. The code generation program according to claim 1, wherein the predetermined algorithm is the Chinese Remainder Theorem.

5. The code generation program according to claim 1, wherein the predetermined algorithm is a prime factorization theorem.

6. The code generation program according to any one of claims 1 to 5, wherein the information is for controlling use of content.

7. The code generation program according to any one of claims 1 to 5, wherein the code is a binary code.

8. a selection step of selecting a plurality of pieces of information to be encoded from the set of information by inputting the first number and the second number;

A code generation step of generating a code compressed by a predetermined algorithm from a first number group and a second number group respectively corresponding to the selected plurality of information;

A code generation method comprising:

9. The set of information is arranged in a matrix, the first number is a number for identifying a row of the matrix, and the second number is for identifying a column of the matrix. 9. The code generation method according to claim 8, wherein the code generation number is a number for use.

10. In the selecting step, a plurality of pieces of the information to be coded are selected using a template in which the first number and the second number are set as defaults in correspondence with a selection pattern. 9. The code generation method according to claim 8, wherein the code generation method comprises:

11. The code generation method according to claim 8, wherein the predetermined algorithm is the Chinese Remainder Theorem.

12. The code generation method according to claim 8, wherein the predetermined algorithm is a prime factorization theorem. 2005/031981

Fifteen

13. The code generation method according to any one of claims 8 to 12, wherein the information is for controlling use of content.

14. The code generation method according to any one of claims 8 to 12, wherein the code is a binary code.

15. A selection means for selecting a plurality of pieces of information to be coded from a set of information by inputting the first number and the second number;

Code generation means for generating a code compressed by a predetermined algorithm from a group of the first number and a group of the second number respectively corresponding to the selected plurality of information;

A code generation device comprising:

16. The set of information is arranged in a matrix, the first number is a number for specifying a row of Matrix, and the second number is a column for specifying the matrix. 16. The code generation device according to claim 15, wherein the code generation number is a number for performing the operation.

1 7. The selecting means selects a plurality of pieces of the information to be encoded by using a template in which the first number and the second number are set as defaults in correspondence with a selection pattern. The code generation device according to claim 15.

18. The code generation device according to claim 15, wherein the predetermined algorithm is the Chinese Remainder Theorem.

1 9. The contracting method according to claim 1, wherein the predetermined algorithm is a prime factorization theorem. Item 15. The code generation device according to Item 15, wherein

20. The code generation device according to any one of claims 15 to 19, wherein the information is for controlling use of content.

21. The code generation device according to any one of claims 15 to 19, wherein the code is a binary code.

22. To cause a computer to execute a control step of controlling use of content based on a code generated by the code generation method according to any one of claims 8 to 13. Content use program.

23. A control step of controlling the use of contents based on the code generated by the code generation method according to any one of claims 8 to 13. How to use content.

24. A control means for controlling the use of contents based on the code generated by the code generation method according to any one of claims 8 to 13 above. Content utilization device.