JP2002050120A - Data recording medium, method and device for recording data, and contents data - Google Patents

Abstract

PROBLEM TO BE SOLVED: To perform sufficient processing even by firmware by minimizing the number of bits to be rewritten including error detection codes and error correction codes when performing management accompanied by watermark rewriting by using a watermark embedded in contents. SOLUTION: When data rewriting is requested, total data amount including CRC codes to be rewritten is found for each pattern to be rewritten. Then, patterns with the minimum total amount of data including CRC codes to be rewritten are extracted from the patterns of which the data have to be rewritten and the most suitable pattern is selected from among them, and an arrangement of data which can be rewritten is decided. Therefore, a data rewriting amount including CRC codes caused by rewriting the data is minimized. Thus, watermark rewriting can sufficiently be performed by using firmware.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to content data, a data recording medium on which content data is recorded, a data recording method and an apparatus, and more particularly to data protection of content.

[0002]

2. Description of the Related Art When recording data of audio contents and video contents on a recording medium, copy management information as additional information is superimposed and embedded in the data of the contents for the purpose of copyright protection. Development is underway. As such a watermark, a method of inserting additional information into lower bits of a signal is known.

As copy management information to be embedded in content as a watermark for the purpose of copyright protection, audio data includes SCMS (Serial Cop).
y Management System) copy management information is used. In the copy management information of SCMS, copy free,
Not only copy prohibition but also copy management over generations can be performed.

Therefore, it is conceivable to embed watermark data in lower bits of content data and record SCMS copy management information in the watermark data.

[0005] In the SCMS, however, it is necessary to rewrite the copy management information when performing the copy management over the copy generations. Such a process of rewriting a watermark imposes a heavy burden compared to the detection of a watermark. In particular, it is desired that the copy management based on the watermark be performed by firmware without using a dedicated IC. However, the processing capability of the firmware is quite small, and it is a considerable burden to perform the watermark rewriting process by the firmware.

Therefore, when watermark data is rewritten for copy generation management, it is desirable to reduce the number of bits to be rewritten as much as possible so as not to burden the firmware processing.

[0007]

As described above, the SCM
In S, watermark data may be rewritten in order to perform copy generation management. The watermark information includes C in order to improve the reliability of the data.
An error detection code such as an RC (Cyclic Redundancy Check) code is added. For this reason, if a CRC code for error detection is added to the watermark data, the CRC code is re-determined and the CRC bits are rewritten in accordance with the rewriting of the data.

Therefore, it is necessary to consider the number of bits at which data is rewritten, including the CRC code. That is, SCMS information is n for copy generation management.
If the bits are rewritten, the SCMS information is rewritten n bits, and accordingly, the CRC code is re-determined and the CRC code is rewritten m bits. Therefore, the number of bits of the rewritten data is
If the CRC code is included, it will be (n + m) bits.

How many bits of the CRC code are to be rewritten depends on the arrangement of data that can be rewritten. For this reason, it is important to determine where to place rewritable data such as SCMS.

However, conventionally, when data is rewritten, the data is not arranged in consideration of the number of rewritten bits, including the CRC code.

Therefore, an object of the present invention is to minimize the number of rewritten bits including an error detection code and an error correction code when performing management involving rewriting of a watermark using a watermark embedded in content. Another object of the present invention is to provide content data, a data recording medium, a data recording device, and a method that can perform sufficient processing even with firmware.

[0012]

According to a first aspect of the present invention, there is provided a data recording medium for recording data by adding an error correction code or an error detection code to predetermined data. , Which includes rewritable data and non-rewritable data, the amount of data rewriting caused by rewriting rewritable data, and the error correction code generated by rewriting rewritable data or This is a data recording medium that extracts a pattern that minimizes the total sum of the error detection code and the rewrite amount, and determines the arrangement of data that can be rewritten based on the extracted pattern.

According to a second aspect of the present invention, there is provided a data recording medium for recording data by adding an error correction code or an error detection code to predetermined data, wherein the predetermined data includes data that can be rewritten. , Data that cannot be rewritten, and the data that can be rewritten include the first
In the case where there is a rewrite pattern of the first rewrite pattern and the second rewrite pattern, the rewrite amount of data generated when the rewrite by the first rewrite pattern occurs and the rewrite amount of the data generated by the rewrite by the first rewrite pattern occur A pattern that minimizes the sum of the amount of error correction code or error detection code to be rewritten and the amount of data rewriting that occurs when rewriting by the second rewriting pattern occurs; A pattern that minimizes the sum of the amount of error correction code or error detection code and the amount of rewriting that occurs when rewriting occurs due to the first rewriting pattern occurs when rewriting by the extracted first rewriting pattern occurs. Occurs when the amount of data rewriting and rewriting by the first rewriting pattern occur. The pattern in which the total sum of the rewrite amount of the error correction code or the error detection code is minimized, the rewrite amount of data generated when rewrite by the extracted second rewrite pattern occurs, and the pattern of the second rewrite pattern A data recording medium that determines the arrangement of data that can be rewritten based on a pattern that minimizes the total amount of error correction codes or error detection codes generated when rewriting occurs. .

According to a twenty-second aspect of the present invention, there is provided a data recording method for recording data by adding an error correction code or an error detection code to predetermined data. , Data that cannot be rewritten, and the amount of data rewriting caused by rewriting data that can be rewritten, and the amount of error correction code or error detection code that is generated by rewriting data that can be rewritten. This is a data recording method in which a pattern that minimizes the sum of the data is extracted, and the arrangement of data that can be rewritten is determined based on the extracted pattern.

According to a twenty-third aspect of the present invention, there is provided a data recording method for recording data by adding an error correcting code or an error detecting code to predetermined data. , Data that cannot be rewritten, and the data that can be rewritten include the first
In the case where there is a rewrite pattern of the first rewrite pattern and the second rewrite pattern, the rewrite amount of data generated when the rewrite by the first rewrite pattern occurs and the rewrite amount of the data generated by the rewrite by the first rewrite pattern occur A pattern that minimizes the sum of the amount of error correction code or error detection code to be rewritten and the amount of data rewriting that occurs when rewriting by the second rewriting pattern occurs; A pattern that minimizes the sum of the amount of error correction code or error detection code and the amount of rewriting that occurs when rewriting occurs due to the first rewriting pattern occurs when rewriting by the extracted first rewriting pattern occurs. Occurs when the amount of data rewriting and rewriting by the first rewriting pattern occur. The pattern in which the total sum of the rewrite amount of the error correction code or the error detection code is minimized, the rewrite amount of data generated when rewrite by the extracted second rewrite pattern occurs, and the pattern of the second rewrite pattern This is a data recording method in which the arrangement of data that can be rewritten is determined based on a pattern that minimizes the total amount of error correction codes or error detection codes generated when rewriting occurs. .

The invention of claim 43 is a data recording apparatus for recording data by adding error correction or an error detection code to predetermined data, wherein the predetermined data includes:
It includes both rewritable data and non-rewritable data, and when rewritable data in predetermined data needs to be rewritten, rewrite rewritable data and rewrite rewritable data. Means for rewriting the error correction code or the error detection code, and the rewritable data is generated by rewriting the rewritable data and the amount of data rewriting caused by rewriting the rewritable data. This is a data recording apparatus that extracts a pattern that minimizes the total amount of error correction codes or error detection codes to be rewritten and that is arranged at a position determined based on the extracted pattern.

A forty-fourth aspect of the present invention is a data recording device for recording data by adding an error correction code or an error detection code to predetermined data. When non-rewritable data is included and the rewritable data in the predetermined data needs to be rewritten, the rewritable data is rewritten, and the error-correcting code or It has means for rewriting the error detection code, and when the data that can be rewritten includes a first rewrite pattern and a second rewrite pattern, the data that can be rewritten is:
The smallest sum of the data rewrite amount generated when rewriting by the first rewrite pattern occurs and the error correction code or error detection code rewrite amount generated when rewrite by the first rewrite pattern occurs. The rewrite amount of data generated when rewriting by the second rewriting pattern occurs and the amount of error correction code or error detection code generated when rewriting by the second rewriting pattern occurs. A pattern whose total sum with the rewrite amount is minimized is extracted, and a rewrite amount of data generated when rewrite by the extracted first rewrite pattern and a rewrite by the first rewrite pattern occur. The smallest sum of the amount of error correction code or error detection code generated Pattern, the amount of data rewriting that occurs when rewriting is performed by the extracted second rewriting pattern, and the error correction code or error detection code that occurs when rewriting is performed by the second rewriting pattern. The data recording apparatus is arranged at a position determined based on a pattern that minimizes the total sum of the rewriting amount and the rewriting amount.

According to a sixty-fourth aspect of the present invention, there is provided content data to which an error correction code or an error detection code has been added, wherein predetermined data includes rewritable data;
Non-rewritable data is included, and the amount of rewriting of data generated by rewriting data that can be rewritten, and the amount of error correction code or error detection code generated by rewriting data that can be rewritten. Is the content data in which a pattern that minimizes the sum of the data is extracted and the arrangement of data that can be rewritten is determined based on the extracted pattern.

According to a sixty-fifth aspect of the present invention, there is provided content data to which an error correction code or an error detection code has been added, wherein the predetermined data includes rewritable data;
When data that cannot be rewritten includes a first rewrite pattern and a second rewrite pattern in data that can be rewritten, the data is generated when rewriting by the first rewrite pattern occurs. A pattern that minimizes the sum of the data rewrite amount and the error correction code or error detection code rewrite amount generated when rewriting by the first rewriting pattern occurs is extracted. Extract a pattern that minimizes the sum of the amount of data rewriting that occurs when rewriting occurs and the amount of rewriting of the error correction code or error detection code that occurs when rewriting occurs with the second rewriting pattern. And data generated when rewriting is performed by the extracted first rewriting pattern. A pattern in which the sum of the rewrite amount and the rewrite amount of the error correction code or the error detection code generated when the rewrite by the first rewrite pattern occurs, and a rewrite by the extracted second rewrite pattern are different. Based on a pattern that minimizes the sum of the amount of data rewriting that occurs when it occurs and the amount of rewriting of the error correction code or the error detection code that occurs when the rewriting by the second rewriting pattern occurs. This is content data for determining the arrangement of data that can be rewritten.

When data rewriting occurs, the amount of total data to be rewritten, including the CRC code, is checked for each rewriting pattern. Then, in the pattern in which data rewriting occurs, the CRC
The pattern including the code and having the smallest total data amount to be rewritten is extracted, and the most suitable pattern is selected from the extracted patterns, and the arrangement of the data that can be rewritten is determined based on this pattern. For this reason, the amount of data rewriting generated by rewriting data becomes the smallest including the CRC code. For this reason,
Rewriting with watermark can be sufficiently performed by firmware.

[0021]

Embodiments of the present invention will be described below with reference to the drawings. In the embodiment of the present invention, when recording content data on a recording medium, watermark data is embedded in the content data.

FIG. 1 shows the structure of a watermark embedded in content data. Content data (here, left (L) right (R) audio data) is processed with 2 bytes (16 bits) per sample. In the least significant bit of the data of this content,
Watermark data (indicated by hatching) is embedded. Therefore, one sample on the left and right (2 bytes + 2
The watermark data is embedded at a rate of 2 bits in the content data of (byte = 4 bytes).

The data of the watermark is, for example, 48
Bits are processed as one information unit (packet). Since the watermark data is embedded at a rate of 2 bits into 4-byte content data of one sample on the left and right, one packet is provided on the content data of 24 samples on the left and right (24 samples × 4 bytes = 96 bytes) (48 bits) watermark data is embedded.

The 48-bit packet includes a packet in which a payload is described and a packet indicating the position of the payload packet. As the payload, for example, copy management information of SCMS is described. Then, in order to identify a packet in which the payload is described and a packet indicating the position of the packet in the payload,
An ID is provided.

The ID of the packet describing the payload is, for example, (ID = 0), and the ID of the packet indicating the position of the packet in the payload is, for example, (ID = 1).
As shown in FIG. 1, in this example, the packet number PCK
(PCK = 0) packet describing payload (ID
= 0, the packet number PCK (PCK = 1)
To 2449) are packets indicating the position of the packet of the payload (packet of ID = 1), and a packet in which the payload is described for every 2450 packets (packet of ID = 0)
There is a packet (a packet with ID = 1) indicating the position of the packet of the payload in all the intervals.

The packet indicating the position of the payload packet includes a payload packet (a packet with ID = 0).
Offset information (Offset_Info) indicating the distance to is described. In this example, as shown in FIG.
A packet (ID) describing the payload for every 50 packets
= 0 packets). If the packet number PCK is (PC
K = 0) is a packet describing a payload (a packet with ID = 0), and the packet number PCK is (P
CK = 1 to 2449) are packets indicating the position of the payload packet (ID = 1 packet). Therefore, the offset information (Offset_Info) is represented as Offset_Info = 2450−PCK PCK: packet number.

When decoding the watermark data, the watermark data embedded in the least significant bit of the content data is extracted. Then, one packet of data consisting of 48 bits is read.

The ID is detected from the read watermark data, and the type of the packet is determined.

If the detected ID is (ID = 0), this packet is a packet for describing the payload, and the processing is performed based on the description of the packet.

If the detected ID is (ID = 1), this packet is a packet indicating the position where the payload packet is located, so the offset information (Offset_Info) is read. Then, a packet located at a position separated by the offset information (Offset_Info) is read. Packets that are separated by the offset information (Offset_Info) are packets for describing the payload, so that processing is performed based on the description of the packets.

That is, as shown in FIG. 2, the packet of the packet number PCK (PCK = 0) is a packet for describing the payload. This packet number P
The CK (PCK = 0) packet has an ID (ID = 0) indicating that it is a packet for describing a payload.
Is attached.

Subsequent packets are packets indicating the position of the payload packet. These packets include a packet number PCK (PCK = 1 to 244).
9) is added in order. These packets have an ID (ID
= 1), and offset information (Offset_Info) is written in these packets. This offset information (Offset_Info) allows the payload packet (ID)
= 0 packet).

That is, when the packet number PCK is (PCK
= 1), the offset information (Offset_Info) to the packet of the next payload is (2450−
1 = 2449) is written. If the packet number PCK is (P
The packet of (CK = 2) has (245) as offset information (Offset_Info) to the packet of the next payload.
0-2 = 2448) is written. The packet with the packet number PCK (PCK = 3) has (2) as offset information (Offset_Info) up to the packet of the next payload.
450-3 = 2447) is written.

Therefore, in the case of the packet (ID = 1) indicating the position of the payload packet, the offset information (Offset_In) is added to the packet number PCK of the packet.
There is a packet (ID = 0) in which the data of the payload is described at the location where the offset is added by only fo).

Thus, in this example, 48 bits are set to 1
The watermark data is embedded in the content data as a packet. One 48-bit packet is
This corresponds to 24 samples (96 bytes) of content data. Then, a packet (packet with ID = 0) describing the payload is provided for every 2450 packets,
The other packets are packets indicating the positions of the packets of the payload (packets with ID = 1).

The packet describing the payload includes SC
MS copy management information is described. In the SCMS, in order to perform copy generation management, in the case of "one generation copy permitted", when copying is performed, the SCMS information is rewritten from "one generation copy permitted" to "no more copy permitted".

For example, as shown in FIG. 3A, the SCMS information is composed of 2 bits, (0, 0) is “copy free”, (0, 1) is “1st generation copy permitted”, (1, 0)
Is "Reserve", (1,1) is "No more copies"
In such a case, when the SCMS information is (0, 1) indicating "1st generation copy permitted", the SCMS information becomes "1st generation copy permitted" when copying is performed.
From (0, 1) to (1, 1) indicating "no more copy allowed", and one-bit rewriting occurs.

Also, for example, the information of SCMS is shown in FIG.
As shown in FIG. 2, (0, 0) is “copy free”, (0, 1) is “copy of one generation”, (1,
In the case where (0) is "No more copy permitted" and (1, 1) is "Reserved", the SCMS information is (0, 1) indicating "One generation copy permitted". In this case, when copying is performed, the SCMS information changes from (0, 1) indicating “1st generation copy permitted” to (1, 0) indicating “no more copy permitted”, and two-bit rewriting occurs. .

As described above, in the packet describing the payload (packet with ID = 0), SCMS information is recorded, and 1-bit or 2-bit data is rewritten in order to perform copy generation management. . On the other hand, the packet (ID
= 1 packet) is a pointer to a packet describing the payload, and does not need to be rewritten.

As the watermark, a watermark that detects a peak value of a signal and inserts a watermark into the peak value so as not to affect the content data,
Various types have been proposed, such as a type that inserts watermark information into lower-order bits of content and a type that inserts watermark information into higher-order coefficients during compression. Of these, any watermark may be used.
However, when information such as SCMS is recorded in a watermark, it is necessary to use a watermark in which data can be easily rewritten because copy generation management is performed.

Next, a packet (I
The packet indicating the position of the payload (the packet with D = 0) and the packet indicating the position of the payload (the packet with ID = 1) will be described.

FIG. 4A shows the configuration of a packet describing a payload (packet with ID = 0), and FIG. 4B shows the configuration of a packet indicating the position of the payload (packet with ID = 1).

Packet describing payload (ID = 0)
), A sync of a predetermined pattern for detecting the head of the packet is provided at the beginning, a CRC code for error detection is provided at the end, and a data area is provided therebetween. In this data area, SC
MS copy management information is arranged.

The SCMS copy management information is composed of two bits as shown in FIG. 3A and in which 1-bit rewrite occurs (hereinafter referred to as 1-bit rewrite SCMS), and as shown in FIG. 3B. Consists of 2 bits
In some cases, bit rewriting occurs (hereinafter, referred to as SCMS of two-bit rewriting).

As the CRC code, for example, a code having a generator polynomial of g ₁ (x) = x ¹⁶ + x ¹⁵ + x ² +1 is used.

In this example, one or two bits of SCMS are rewritten in order to perform copy generation management. When one or two bits of the SCMS are rewritten, the CRC code is recalculated accordingly,
The code is rewritten. How many bits of the CRC code are rewritten depends on the arrangement of SCMS bits at which rewriting occurs. Therefore, in order to reduce the number of bits in which rewriting occurs, it is important where SCMS information is arranged.

Note that the SCMS information is 2 bits, whereas the data area is 16 bits. Therefore, when 2-bit SCMS information is arranged in this data area, the remaining 14 bits can be reserved as a reserved area.

Packet indicating the position of the payload (ID =
4B, a sync of a predetermined pattern for detecting the head of the packet is provided, a CRC code for error detection is provided at the end of the packet, and a data area therebetween is provided as shown in FIG. 4B. , Offset information (Offset_Info) is arranged.

The packet (I) indicating the position of this payload
(D = 1 packet), since the information is not rewritten, the CRC code does not change. Therefore, where to place the offset information (Offset_Info) in the 48-bit packet is not a very important issue.

As described above, in this example, the packet describing the payload (packet with ID = 1) and the packet describing the position of the payload (packet with ID = 0) are provided, and the packet describing the payload (packet with ID = 0) is provided. In order to manage the copy generation, the SC
Rewriting of MS bits occurs. At this time, the CRC code is also rewritten. How many bits of the CRC code are rewritten depends on the bit arrangement of the SCMS in which rewriting occurs. For this reason, in order to minimize the total number of bits in which rewriting occurs, it is important where to place rewritable data such as SCMS.
This will be described below.

As shown in FIG. 5, 32 bits (b ₃₁ , b ₃₀ ,..., B ₀ ) of the 48-bit data are used as information bits, and 16 bits (c ₁₅ , c ₁₄ ,..., C ₀ ) are used. CRC bits. It is assumed that a CRC code generator polynomial of g ₁ (x) = x ¹⁶ + x ¹⁵ + x ² +1 is used. FIG. 6 shows the result of examining the pattern of bits that may cause rewriting in such a configuration. As shown in FIG. 6, the minimum number of bits at which rewriting occurs is 4 bits.

That is, FIG. 6 shows the number of patterns of bits that may be rewritten when the above-described generator polynomial is used, for each number of rewritten bits.
As shown in FIG. 6, the rewriting pattern of 0 bit is 1
However, this means that the bit is not rewritten. A pattern in which 2-bit rewriting occurs does not exist due to the nature of the generator polynomial. Further, there is no pattern for rewriting odd bits. Therefore, the minimum number of rewriting bits in a bit pattern in which rewriting occurs is a 4-bit pattern.
There are 140 patterns in which this 4-bit rewriting occurs. Next is a 6-bit pattern. There are 2035 patterns in which the 6-bit rewrite occurs. Next, there are 8 bits, and there are 24996 patterns in which the 8-bit rewrite occurs. Hereinafter, the number of patterns for each number of bits at which rewriting occurs is as shown in FIG.

From the results shown in FIG. 6, the SCM is included in the information bits so as to form a pattern in which 4-bit rewriting occurs.
By arranging the S bit, rewriting of 4 bits in total is completed, including the CRC code. Since there are 2035 patterns in which 6-bit rewriting occurs and 24996 patterns in which 8-bit rewriting occurs, if the SCMS bit arrangement is not considered at all, the total number exceeding 4 bits is The possibility of rewriting is very high.

The pattern in which 4-bit rewriting occurs is 1
There are 40 patterns, and FIGS. 7 and 8 show these 140 patterns. 7 and 8, as shown in FIG. 5, 32 information bits (b ₃₁ , b ₃₀ ,
.., B ₀ ) and 16 CRC bits (c ₁₅ c ₁₄ ,
... c ₀₎ are the notation in hexadecimal. When the information bits and the CRC bits represented by the hexadecimal number are converted into the representation of the binary number, the bits where "1" stands are rewritten bits. If an optimal pattern is selected from the 140 patterns and SCMS bits are arranged based on the pattern, copy management can be performed by rewriting the entire 4 bits including the CRC code.

First, a description will be given of a case where the SCMS of 1-bit rewriting (FIG. 3A) is used as the SCMS. When the SCMS of 1-bit rewriting is used, one bit of information bits is rewritten from 140 patterns in which 4-bit rewriting occurs as shown in FIGS.
One in which three RC bits are rewritten is selected.

One information bit and three CRC bits
FIGS. 7 and 8 show patterns for bit rewriting.
In the pattern P1, P14, P16, P20, P
There are seven patterns of 40, P47, and P55 (indicated by “*”). If an optimum pattern is selected from these seven patterns and SCMS information is arranged in accordance with the selected pattern, copy management can be performed by rewriting a total of 4 bits including the CRC code.

If the entire information bit can be used by allocating it to SCMS information, any of these seven patterns can be used. However, in order to arrange non-rewritable data such as a sink at the head of the packet (see FIG. 4), for example, the 16 bits from the head of the packet include the SC.
MS information cannot be located.

One information bit and three CRC bits
The patterns whose bits are rewritten include the patterns P1, P1
4, P16, P20, P40, P47, and P55, in which a pattern in which the first 16 bits of the information bits are not rewritten (that is, the first 16 bits are “00 00 (h)” in hexadecimal notation) Are patterns P1, P14, P16, and P20. Therefore, it is conceivable to arrange SCMS information according to any of the patterns P1, P14, P16, and P20.

For example, assume that the pattern P16 is selected. In this pattern, the information bits are (00 00 4
00 00) h, the CRC bit is (8006) h. When this is represented by a binary number, information bits (b ₃₁ , b ₃₀ ,...,
b ₀ ) becomes (00000000 00000000 01000000 00000000), the CRC bits (c ₁₅ , c ₁₄ ,..., c ₀ ) become (10000000 00000110), the information bit b ₁₄ contains “1”, and the CRC bits c ₁₅ , c There is “1” in ₂ and c ₁ .

Therefore, in this case, as shown in FIG. 9A, two bits of SCMS are assigned to the information bits (b ₁₄ , b ₁₃ ). When performing one-generation copy permission control, it is two bits of SCMS (b _14, b ₁₃₎ from (0,1) (1,1), rewriting of information bits b ₁₄ occurs. At this time, the bits c ₁₅ , c ₂ , and c _{1 of the} CRC are rewritten along with rewriting the information bit b ₁₄ . Accordingly, the information bits b _14, bits c ₁₅ of CRC, c _2, a total of 4 bits rewriting c ₁ occurs.

Next, a case where a 2-bit rewritten SCMS (FIG. 3B) is used as the SCMS will be described.
In the case of using the 2-bit rewriting SCMS, two consecutive information bits are selected from 140 patterns in which 4-bit rewriting occurs as shown in FIGS.
One in which two CRC bits are rewritten is selected.

Two consecutive information bits and a CRC
7 and FIG. 8, patterns P2 to P13, P15,
16 patterns of P72, P78 and P89 ("*
* "). By selecting one pattern from these 16 patterns and allocating SCMS bits based on the pattern, generation of copy can be managed by rewriting 4 bits.

Since non-rewritable data such as a sink is arranged at the beginning of the packet, SCMS information cannot be arranged at the 16 bits from the beginning of the information bit.

Among the patterns in which two consecutive information bits and two CRC bits are rewritten, the patterns in which the first 16 bits of the information bits are not rewritten are patterns P2 to P13 and P15. Therefore, it is conceivable to arrange SCMS information according to any of the patterns P2 to P13 and P15.

For example, assume that the pattern P10 is selected. In this pattern, the information bits are (00 00 0) from FIG.
3 00) h, the CRC bit is (0a 00) h. When this is represented by a binary number, information bits (b ₃₁ , b ₃₀ ,..., B ₀ )
Becomes (00000000 00000000 00000011 00000000), the CRC bits (c ₁₅ , c ₁₄ ,..., C ₀ ) become (00001010 00000000), the information bits b ₉ and b ₈ become “1”, and the CRC
Bits c ₁₁ and c ₉ become “1”.

Therefore, in this case, as shown in FIG. 9B, two bits of SCMS are allocated to the information bits (b ₉ , b ₈ ). When the control of one-generation copy is performed, two bits of SCMS are changed from (0, 1) to (1, 0), and information bits b ₉ and b ₈ are rewritten. At this time, the bits c ₁₁ and c _{9 of the} CRC are rewritten along with the rewriting of the information bits b ₉ and b ₈ . As a result, a total of 4 bits of the information bits b ₉ and b ₈ and the bits c ₁₁ and c ₉ of the CRC are rewritten.

In the above example, g (x) = x ¹⁶ + x ¹⁵ + x ² +1 is used as a generator polynomial of the CRC code, but another generator polynomial may be used.

For example, g (x) = x ¹⁶ + x ¹² + x ⁵ +1 may be used as a CRC code generator polynomial.

When such a generating polynomial is used, FIG. 10 shows the number of patterns in which rewriting is likely to occur for each number of bits in which rewriting occurs. That is, the minimum number of rewriting bits in a pattern in which rewriting occurs is a 4-bit pattern, and there are 48 patterns in which the 4-bit rewriting occurs. next,
This is a 6-bit pattern, and there are 450 patterns in which this 6-bit rewrite occurs, and the next is 8-bit, and the pattern in which this 8-bit rewrite occurs is 112
There are 06 ways. Hereinafter, the number of patterns for each number of bits at which rewriting occurs is as shown in FIG.

From the results shown in FIG. 10, SC bits are included in the information bits so as to form a pattern in which 4-bit rewriting occurs.
By arranging the bits of MS, rewriting of four bits in total including the CRC code is sufficient.

When the SCMS of 1-bit rewriting (FIG. 3A) is used, one of information bits and a CRC are selected from 48 patterns in which 4-bit rewriting occurs.
One in which three bits of the code are rewritten is selected.

FIG. 11 shows a case where 4-bit rewriting occurs.
This shows eight patterns. Among these patterns, patterns in which one information bit and three CRC bits are rewritten include patterns P1, P2, P
There are four patterns, 3, and P4. A pattern is selected from these four patterns, and the SC
By arranging the information of the MS, copy management can be performed by rewriting a total of 4 bits including the CRC code.

The 16 bits from the head of the packet, for example, are used to arrange non-rewritable data such as a sink, so that SCMS information cannot be arranged.

Each of the patterns P1 to P4 is a pattern in which one information bit is rewritten, and the 16 bits from the head of the information bit are not rewritten. Therefore, according to any of the patterns P1 to P4, the SCM
It is conceivable to arrange S information.

For example, assume that the pattern P2 is selected.
In this pattern, the information bits are (00 00 00
02) h, the CRC bit is (2042) h. When this is represented by a binary number, the information bits (b ₃₁ , b ₃₀ ,..., B ₀ ) are (00000000 00000000 00000000 00000010), and the CRC bits (c ₁₅ , c ₁₄ ,..., C ₀ ) are (00100000 01000010). , The information bit b ₁ becomes “1”, and the CRC bits c ₁₃ , c ₆ and c ₁ become “1”.

Therefore, in this case, as shown in FIG. 12A, two bits of SCMS are assigned to the information bits (b ₁ , b ₀ ). At the time of controlling the first generation copy, the two bits (b ₁ , b ₀ ) of SCMS are changed from (0, 1) to (1, 1), and the information bit b ₁ is rewritten. At this time, along with rewriting of information bits b _1, bit c _13, c _6, c ₁ of CRC is rewritten. As a result, a total of 4 bits of the information bit b ₁ and the bits c ₁₃ , c ₆ and c ₁ of the CRC are rewritten.

As SCMS, a 2-bit rewritten SC
When MS (FIG. 3B) is used, a pattern in which 2 bits of continuous information bits and 2 bits of a CRC code are rewritten is selected from 48 patterns in which 4-bit rewriting shown in FIG. 10 occurs. Is done.

Two consecutive information bits and a CRC
The pattern in which two bits are rewritten is
It is not present in street patterns. For this reason, in this case, SCMS of 2-bit rewriting cannot be performed by 4-bit rewriting as a whole.

In this case, it is conceivable that the information bits are two non-consecutive bits.

For example, in the pattern P5, the information bit is (0
0 00 00 11) h and the CRC bit is (02 10) h
You. When this is represented by a binary number, the information bit (b₃₁, B₃₀,
…, B ₀) Becomes (00000000 00000000 00000000 00010001), the CRC bits (c15 to c0) become (00000010 00010000), and the information bit b_Four, B₀Becomes “1” and the CRC
Bit c₉, C_FourBecomes “1”. Thus, discontinuous
However, two information bits and two CRC bits are used.
Bit is rewritten.

When this pattern P5 is adopted, as shown in FIG. 12B, the information bits (b ₄ , b ₀ )
Two bits of MS are allocated. When performing control to permit one-generation copy, the information bits (b ₄ , b ₀ ) are set to (0, 1)
To (1, 0) and the information bit b
₄ , along with rewriting b ₀ , CRC bit c
₉ and c ₄ are rewritten.

In the example described above, 48 bits are one information unit (packet), of which 32 bits are information bits and 16 bits are CRC bits. Of course, the size of the information unit is 48 bits. Not always.

For example, as shown in FIG. 13, it has been proposed that 32 bits be one information unit, of which 24 bits are information bits and 8 bits are CRC bits.

32 bits are defined as one information unit.
When 24 bits are used as information bits and 8 bits are used as CRC bits, a CRC code generator polynomial, for example, g (x) = x ⁸ + x ⁴ + x ³ + x ² +1 is used.

Note that g (x) = x ⁸ + x ⁶ + x ⁵ + x ⁴ +1 may be used as a CRC code generator polynomial.

In this case, the number of patterns in which rewriting is likely to occur is indicated for each number of bits in which rewriting occurs.
As shown in FIG. 14, the minimum number of rewriting bits in a pattern in which rewriting occurs is a 3-bit pattern, and there are 18 patterns in which the 3-bit rewriting occurs. Next is a 4-bit pattern. There are 128 patterns in which 4-bit rewriting occurs. Next, there are 5 bits, and there are 800 patterns in which 5-bit rewriting occurs. Hereinafter, the number of patterns for each number of bits at which rewriting occurs is as shown in FIG.

FIG. 15 shows 18 patterns in which 3 bits including information bits and CRC bits are rewritten.

As SCMS, 1-bit rewritten SC
When the MS (FIG. 3A) is used, a pattern in which one bit of information bits and two bits of CRC bits are rewritten is selected from the 18 patterns shown in FIG.

FIG. 15 shows patterns P5, P7, P9, P11, P13, P13
15 and 17 patterns are available.
By selecting one pattern from these seven patterns and allocating SCMS bits based on this pattern, it becomes possible to perform copy generation management by rewriting three bits.

Here, if 16 bits are reserved for allocating non-rewritable data such as a sync at the head of the packet, the 16 bits from the head of the information bit include S bits.
CMS information cannot be located. Patterns P5, P7, P9, P11, P13, P1 for 3-bit rewriting
Neither P5 nor P17 can satisfy this condition.

Next, it is assumed that a 2-bit rewritten SCMS (FIG. 3B) is used as the SCMS. In this case, a pattern in which two consecutive information bits and two CRC bits are rewritten is selected from the 18 patterns shown in FIG.

However, among the 18 patterns shown in FIG. 15, there is no pattern in which two consecutive information bits and one CRC bit are rewritten.

As described above, although the 3-bit rewriting is the minimum, there is no pattern matching the condition in the 3-bit rewriting pattern.

Therefore, in this case, it is conceivable to select from among patterns in which the number of bits to be rewritten is small and 4-bit rewriting is performed.

As shown in FIGS. 16 and 17, there are 128 types of rewrite patterns of 4 bits including the information bits and the CRC bits.

As SCMS, 1-bit rewritten SC
Assuming that MS (FIG. 3A) is used, a pattern in which one information bit and three CRC bits are rewritten is selected from the 128 patterns shown in FIGS. Then, it is assumed that SCMS information is not arranged in the first 16 bits of the information bits so that 16 bits can be secured as non-rewriteable data such as a sink at the beginning of the packet. The patterns satisfying this condition are the pattern P1 and the pattern P2. Therefore,
In this case, SCMS information is arranged according to either the pattern P1 or the pattern P2.

For example, in the pattern P1, the information bit is (0
0) h, and the CRC bit is (13) h. When this is represented by a binary number, information bits (b ₂₃ , b ₂₂ ,...,
b ₀ ) becomes (00000000 00000000 01000000), the CRC bits (c ₇ , c ₆ ,..., c ₀ ) become (00010011), the information bit b ₆ becomes “1”, and the CRC bits c ₄ , c ₁ , c ₀ becomes “1”.

Therefore, in this case, as shown in FIG. 18A, two bits of SCMS are allocated to the information bits (b ₆ , b ₅ ). When the control of the one-generation copy is performed, the two bits (b ₆ , b ₅ ) of the SCMS are changed from (0, 1) to (1, 1), and the information bit b ₆ is rewritten. Then, at this time, the bits c ₄ , c ₁ , and c _{0 of the} CRC are rewritten as the information bit b ₆ is rewritten. As a result, a total of 4 bits of the information bit b ₆ and the bits c ₄ , c ₁ and c ₀ of the CRC are rewritten.

As SCMS, as shown in FIG. 3B,
Assuming that SCMS with 2-bit rewriting is used, FIG.
A pattern in which two information bits and two CRC bits are rewritten is selected from the 128 patterns shown in FIG. Then, it is assumed that SCMS information is not arranged in the first 16 bits of the information bits so that 16 bits can be secured as unrewritable data at the beginning of the packet.

A pattern satisfying this condition is represented by
Although not present in the eight patterns, there is a pattern P3 in which three information bits and one CRC bit are rewritten, and that 16 bits can be secured as a sync at the head of the packet. In the pattern P3, two consecutive information bits are rewritten. Therefore, this pattern P3 is convenient to use the SCMS of 2-bit rewriting. Assuming that SCMS information is assigned to two consecutive information bits, one more information bit is rewritten.
It is conceivable that this one bit uses other information to be rewritten, for example, as bits of original content identification information indicating original / non-original information.

That is, the information bit of the pattern P3 is (0
0) 83) h, and the CRC bit is (01) h. When this represented in binary, information bits (B23～b0) is (00000000 00000000 10000011), and the CRC bits _{(c 7, c 6, ...} , c 0) is (00000001), and the information bits b _7, b ₁ , B ₀ becomes “1”,
The CRC bit c0 becomes “1”.

Therefore, in this case, as shown in FIG. 18B, two bits of SCMS are assigned to the information bits (b ₁ , b ₀ ). Further, the information bits b _7, is assigned original content identification information.

When performing control to permit one-generation copy, the SCM
The two bits of S change from (0,1) to (1,0) and SC
Rewriting of the information (b ₁ , b ₀ ) of the MS occurs. Also,
1 from original recording medium to non-original recording medium
When the degree copy is rewritten original content identification information bit b _7. At this time, along with rewriting the information bits b ₇ , b ₁ , b ₀ , the CRC
Bits c ₀ is rewritten. As a result, a total of 4 bits of information bits b ₇ , b ₁ , b ₀ and CRC bit c ₀ are rewritten.

As described above, when three information bits can be rewritten, two bits of SCMS information and one of original content identification information indicating original / copy content can be rewritten.
Bits. In this example, the original content is basically one-generation copy permitted, and when the original recording medium is copied once, the SCMS information indicates "one generation copy permitted" (0, 0).
From 1), indicates "no more copies allowed" from (1,
Original content identification information indicating original / copy content is rewritten from "original" to "copy" while being rewritten to 1).

Next, an example will be described in which one packet is composed of 32 bits in which information bits are 8 bits and CRC bits are 8 bits and a 16-bit sync of a predetermined pattern is added to the head of data.

In this example, at the beginning of one packet, FIG.
As shown in FIG. 9, for example, a sync of 16 bits is added. The information bits are an 8-bit area excluding the sync part, and an 8-bit CRC code is added to the 8-bit information bits.

In this example, SCMS and original content identification information indicating original / non-original are provided as data that can be rewritten. That is, as shown in FIG. 20, in the original content identification information, “0” is “original content” and “1” is “copied content”.

As shown in FIG. 3B, for the SCMS information, for example, (0, 0) indicates that “no more copying is possible”,
1-bit rewriting SCMS is used in which (0, 1) is set to "1 generation copy permitted", (1, 0) is set to "reserve", and (1, 1) is set to "copy free". .

When the original content can be copied for one generation and the original recording medium is copied once, the SCMS information indicates "copy for one generation" (0, 0).
From 1), indicates "no more copies allowed" from (1,
In addition to being rewritten to 0), the original content identification information indicating the original / copy content is rewritten from "0" indicating "original" to "1" indicating "copy", and two-bit rewriting occurs.

The original content may be copy-free, and when such copy-free content is copied, the SCMS information remains (1, 1) indicating “copy free”. The original content identification information is “0” indicating “original”
To “1” indicating “copy”, and one-bit rewriting occurs.

As described above, in this example, the SCMS information and the original content identification information are data that can be rewritten. When the original content of “1 generation copy permitted” is copied, one bit of the SCMS and the original content are copied. When two bits are rewritten with one bit of the identification information, and the original content of “copy free” is copied, only the original content identification information is rewritten by one bit, and in a pattern in which two bits are rewritten. And a pattern in which 1-bit rewriting occurs.

In this example, both the pattern in which one bit of SCMS and one bit of the original content identification information are rewritten, and the pattern in which only one bit of the original content identification information is rewritten, The SCMS bits and the bits of the original content identification information are arranged at positions where the number of bits that cause rewriting including the CRC code is minimized.

The bit arrangement of such SCMS bits and original content identification information can be determined as follows.

First, when only one bit of the original content identification information is rewritten, a pattern is selected so that the number of rewritten bits including the CRC code is minimized.

That is, as shown in FIG. 19, when the information bits are 8 bits, the CRC bits are 8 bits, and the generator polynomial of the CRC code is g (x) = x ⁸ + x ⁴ + x ³ + x ² +1, the information As a pattern in which one bit is rewritten, there are eight patterns as shown in FIG.

Among these, the pattern including the CRC code that minimizes the number of rewritten bits is selected. When the number of rewritten bits is the smallest, the number of rewritten bits is 4 including the CRC code.
The pattern in which bits are rewritten is a pattern P7 and a pattern P8.
There are two ways.

Next, when two bits, one bit of the SCMS and one bit of the original content identification information, are rewritten, a pattern including the CRC code that minimizes the number of rewritten bits is selected. Is done. As a pattern in which two bits of information bits are rewritten, there are 28 patterns as shown in FIG.

Among these, the pattern that minimizes the number of rewritten bits, including the CRC code, is selected. The minimum number of bits that can be rewritten is the CRC
The pattern that becomes 5 bits including the code, and the pattern that is rewritten with 5 bits in this way is the pattern P
7, pattern P10, pattern P15, pattern P1
6, pattern P17, pattern P21, pattern P2
3, pattern P24, and pattern P27.

Among the patterns in which one bit of the information bits shown in FIG. 21 is rewritten, the pattern P is the pattern in which the number of rewritten bits is the minimum of 4 bits.
Suppose you chose 8. In this pattern P8, the information bits (b ₇ , b ₆ ,... B ₀ ) are (80) in hexadecimal notation,
If this is converted into a binary display, it becomes (10000000). Therefore, the information bits to be rewritten is the bit b _7.

Among the patterns in which the two bits of the information bits shown in FIG. 22 are rewritten, one of the rewritten bits is the one shown in FIG. Is selected as the one bit to be rewritten in the pattern to be rewritten.

That is, the information bit 1 shown in FIG.
Among the patterns in which bits are rewritten, the minimum number of rewritten bits at 5 bits is the pattern P7,
There are nine patterns P10, P15, P16, P17, P21, P23, P24, and P27. In these nine patterns, the bit to be rewritten is bit b
_The one at position ₇ is selected.

[0122] In this, what bits to be rewritten is in the position of the bit b _7, the pattern P23, the pattern P
24 and pattern P27.

That is, in the pattern P23, the information bits (b ₇ , b ₆ ,... B ₀ ) are (82) in hexadecimal notation,
If this is converted into a binary display, it becomes (10000010). Therefore, the bits to be rewritten are bit b ₇ and bit b ₁
And the information bit b is similar to the pattern P8 in FIG.
₇ is rewritten.

The pattern P24 includes information bits (b ₇ , b
₆ ... B ₀ ) is (84) in hexadecimal notation and converted to binary notation to be (10000100). Therefore, the bit to be rewritten is a bit b ₇ to the bit b _2, similarly to the pattern P8 in FIG. 21, the rewriting of the information bits b ₇ is caused.

The pattern P27 is composed of information bits (b ₇ , b
₆ ,... B ₀ ) is (a0) in hexadecimal notation, and when converted to binary notation, it becomes (10100000). Therefore, the bit to be rewritten is a bit b ₇ to the bit b _5, similarly to the pattern P8 in FIG. 21, the rewriting of the information bits b ₇ is caused.

Therefore, no matter which of these three patterns is selected, a minimum of 4 bits including the CRC code is required for a 1-bit rewrite pattern, and a minimum of 4 bits is used for a 2-bit rewrite pattern.
It can be rewritten with a minimum of 5 bits including the code. Any of these three patterns may be selected, but here, the pattern P24 is selected.

FIG. 23 shows the bit arrangement determined in this way. As shown in FIG. 23, the bit b ₇ information bits, are assigned original content identification information. 2 information bits (b ₃ , b ₂ )
Are assigned two bits of SCMS.

In FIG. 23, bits b ₆ and b
₅ is assigned original media identification information indicating the type of the original recording medium. This indicates (0, 0): ROM (0, 1): R / RW (1, 0): hybrid of ROM and R / RW (1, 1): arbitrary recording medium.

[0129] Furthermore, copyright is assigned to the bit b _4. In this case, “0” indicates that there is a copyright, and “1” indicates that there is no copyright.

[0130] When the original contents of the copy free is copied, the bit b ₇ arranged as original content identification information is rewritten 1 bit. At this time, next pattern P8 in FIG. 21, the information bits b _7, 4 bits rewriting CRC bits c _5, c _2, c ₁ is generated. Rewriting of 4 bits including the CRC code is the minimum amount of rewriting when rewriting one bit of the information bit.

[0131] with one generation bit b ₇ arranged as original content identification information when the original content copyable is copied is rewritten, SC
The two bits (b ₃ , b ₂ ) of the MS are changed from (0, 1) to (0,
Becomes 0), 2-bit information bit b ₇ the information bit b ₂ is rewritten. In this case, the bit b ₇ to the bit b pattern P23, and the information bits in FIG. 22
₂ and 5 bits of the CRC bits c ₆ , c ₄ and c ₁ are rewritten. Rewriting of 5 bits including the CRC code is the minimum amount of rewriting when rewriting 2 bits of information bits.

Next, a recording apparatus for recording data on a recording medium by embedding a watermark in content data as described above will be described.

FIG. 24 shows an example of such a recording apparatus. In this example, a recordable optical disk (CD-R or CD-RW) is used as a recording medium.

In FIG. 24, input terminal 1 is supplied with content data. The content data is, for example, left and right digital audio data digitized by 16 bits. The data of this content is supplied from the input terminal 1 to the watermark adding circuit 2.

The input terminal 3 is supplied with watermark data. The watermark data is supplied to the watermark generation circuit 4. The output of the watermark generation circuit 4 is supplied to the watermark addition circuit 2.

In the watermark adding circuit 2, the input terminal 1
The watermark data from the watermark generation circuit 4 is embedded in the data of the content from. As described above, 48 bits of the watermark are processed as one packet. A packet describing the payload (a packet with ID = 0) is provided, for example, every 2450 packets, and a packet indicating the position of the packet in the payload (a packet with ID = 1) is provided between the packets. The watermark adding circuit 2 generates such two types of packets.

In the SCMS, since the generation of the copy is managed, the watermark may need to be rewritten. The rewriting of the watermark is performed using a packet describing the payload (a packet with ID = 0).

An error detection CRC code is added to one packet. For this reason, when rewriting the payload of the packet describing the payload (packet with ID = 0), it is necessary to recalculate the CRC code and rewrite the CRC code. However, the process of re-calculating and rewriting the CRC code is burdensome and difficult with firmware.

Therefore, as described above, the arrangement of SCMS information is determined so that the total number of rewritten bits, including the CRC code, is minimized.

Further, as the watermark, for example,
What embeds watermark data in lower bits of content data is used.

As the watermark, a method of inserting additional information into a higher-order coefficient at the time of compression, a method of dispersing the spectrum of additional information using spread spectrum and superimposing it on content data, A method of inserting the peak at the first peak or the second peak or at the vicinity thereof is known. Of course, other watermarks can be used.

However, in order to perform copy generation management by SCMS, it is necessary to rewrite a watermark. Considering the rewriting of a watermark, a method of inserting a watermark into the lower bits of the content data, It is conceivable to use a method of inserting additional information into higher-order coefficients of. In the method of dispersing the spectrum of the additional information using spread spectrum and superimposing it on the data of the content, or the method of inserting the spectrum into the first peak or the second peak in a predetermined range or in the vicinity thereof, the water is used according to the content data. It is difficult to rewrite a watermark because a mark must be added. Further, it is conceivable to use the masking effect so as not to affect the content.

The output of the watermark adding circuit 2 is supplied to an error correction encoding circuit 5. The error correction encoding circuit 5 performs an error correction process.

The output of the error correction coding circuit 5 is supplied to a modulation circuit 6. The output of the modulation circuit 6 is supplied to the optical pickup 8 via the recording amplifier 7. The optical pickup 8 records content data in which the watermark data is embedded on the optical disc 9.

An optical disk on which content data is recorded is usually sold or distributed as a read-only disk such as a CD or CD ROM. In this case, an optical disk for sale or distribution is manufactured using the optical disk created as described above as a master.

FIG. 25 shows an example of an encoder for inserting a watermark into content data. In this example, watermark information is inserted into lower bits of content data. And in this example,
The components of the information of the watermark are put in a band that does not affect the auditory sense. Such an encoder is
It can be used as the watermark adding circuit 2 in FIG.

In FIG. 25, original data is supplied to the input terminal 11. The watermark data is supplied to the input terminal 12.

The data of the watermark from the input terminal 12 is supplied to the randomizer 13. Randomizer 1
In step 3, the watermark data is converted to white noise.
The output of the randomizer 13 is supplied to a subtraction circuit 14 and an addition circuit 15.

The data from the input terminal 11 is
6. The output of the subtraction circuit 16 is supplied to the subtraction circuit 17 while being supplied to the subtraction circuit 14. The output of the subtraction circuit 14 is supplied to a quantization circuit 18. The output of the quantization circuit 18 is supplied to the addition circuit 15.

In the adding circuit 15, the output of the quantization circuit 18 and the output of the randomizer 3 are added. Addition circuit 1
5 is output from the output terminal 21 and supplied to the subtraction circuit 17. In the subtraction circuit 17, the output of the addition circuit 16 is subtracted from the output of the addition circuit 15.

The output of the subtraction circuit 17 is supplied to the noise shape filter 20. The output of the noise shape filter 20 is supplied to the subtraction circuit 16. In the subtraction circuit 16, the output of the noise shape filter 20 is subtracted from the data from the input terminal 11.

A watermark encoder as shown in FIG. 25 inserts watermark data into lower bits of data. Then, in order to prevent the influence of the watermark from being inserted into the data of the content, a noise component is put in a place where there is no problem in terms of audibility.

That is, in FIG. 25, the data from the input terminal 11 is quantized by the quantization circuit 18. The addition circuit 15 inserts the watermark data from the randomizer 13 into the lower bits of the data output from the quantization circuit 18.

At the stage preceding the quantization circuit 18, the subtraction circuit 14
Is provided. Then, in the subtraction circuit 14, the data of the watermark is subtracted from the data from the input terminal 11. As described above, at the preceding stage of the quantization circuit 18, the data of the watermark is subtracted from the data from the input terminal 11. This eliminates the effect of the watermark data being inserted into the content data in the addition circuit 15 subsequent to the quantization circuit 18.

The addition circuit 15 outputs data to which watermark data has been added. This addition circuit 1
5 is output from the output terminal 21. With this,
In the subtraction circuit 17, the output data of the addition circuit 15 and the output data of the subtraction circuit 16 are subtracted. This subtraction circuit 17
As a result, the output data from the quantization circuit 18 and the input data to the quantization circuit 18 are subtracted, and a noise component accompanying the quantization is extracted. This noise component is moved by the noise shape filter 20 to a place where there is no problem in audibility, and is supplied to the subtraction circuit 16.

FIG. 26 shows an example of a watermark decoder for decoding the information of the watermark inserted as described above.

In FIG. 26, the data of the content with the watermark superimposed thereon is supplied to the input terminal 31 as described above. Data from the input terminal 31 is supplied to the quantization circuit 32. The output of the quantization circuit 32 is output from the output terminal 33 and supplied to the lower bit extracting circuit 34.

The lower bit extracting circuit 34 extracts the watermark data inserted in the lower bits of the data. The watermark data is supplied to the reverse randomizer 35.

The reverse randomizer 35 performs a process corresponding to the randomizer 13 in the encoder described above. By the inverse randomizer 35, the randomized watermark information is returned to the original state. Watermark information can be obtained from the reverse randomizer 35. The information of the watermark is output from the output terminal 36.

FIG. 27 shows an example of a reproducing apparatus. FIG.
The data recorded on the optical disk 41 is read by the optical pickup 42, and the output of the optical pickup 42 is supplied to the demodulation circuit 44 via the reproduction amplifier 43. The output of the demodulation circuit 44 is supplied to an error correction circuit 45.
The error correction circuit 45 performs an error correction process.

The output of the error correction circuit 45 is supplied to a D / A converter 49. The D / A converter 49 converts the digital signal into an analog signal. The output of the D / A converter 49 is output from the output terminal 50.

The output of the error correction circuit 45 is supplied to a watermark detection circuit 46 and also to a watermark addition circuit 51. The watermark detection circuit 46 detects data of the watermark.

The output of the watermark detection circuit 46 is supplied to a judgment circuit 47. The switch circuit 48 is controlled based on the output of the judgment circuit 47, and the copy is controlled.

The output of the error correction circuit 45 is supplied to a watermark adding circuit 51. The watermark generation circuit 52 generates a watermark based on the output of the determination circuit 47. This watermark is output from the watermark generation circuit 52 to the watermark addition circuit 5.
1 is supplied. By the watermark adding circuit 51,
When the watermark needs to be rewritten, a watermark rewriting process is performed.

The output of the watermark adding circuit 51 is supplied to the data output terminal 53 via the switch circuit 48.

Watermark data is embedded in content data recorded on the optical disk 41, and the watermark data is detected by the watermark detection circuit 46. Watermark detection circuit 4
As for 6, the structure shown in FIG. 9 can be used.

As described above, the watermark is 48
The bits are processed as one packet. Then, a packet describing the payload (a packet with ID = 0) is provided, for example, for every 2450 packets, and the packet between them is a packet (ID) indicating the position of the payload packet.
= 1 packet).

The determination circuit 47 reads one packet of data consisting of 48 bits, detects an ID from the read watermark data, determines the type of the packet, and sets the detected ID to (ID = 0). Then, since this packet is a packet for describing the payload, copy restriction processing is performed based on the description of the payload of the packet. If the detected ID is (ID = 1), the offset information (Offset_Info ) Is read, and a packet of a payload located at a position separated by offset information (Offset_Info) is read, and copy restriction processing is performed based on the description of the payload of the packet.

In the above example, the case where a watermark embedded in content data is processed has been described. However, the present invention is not limited to the case where a watermark is processed.

In the above example, the error detection code of the CRC code is added. However, in the case of the error correction code, similarly, the number of bits that can be rewritten including the error correction code is minimized. Next, the data position of the data that is to be rewritten, such as SCMS, is selected.

Further, in the above example, data is processed in units of bits, but may be processed in units of bytes. For example, when error correction processing can be performed in byte units, data that can be rewritten in byte units is rewritten, and error correction processing is performed in byte units. Then, the data position of the data that can be rewritten is selected in byte units so that the data amount of the data that can be rewritten in byte units and the data amount of the error correction or error detection code that is rewritten in accordance therewith are minimized. You.

By selecting an arrangement of rewritable data so that the amount of error correction or error detection code rewritten along with data rewriting becomes “0”, error correction or error correction can be performed when data is rewritten. There is no need to rewrite the error detection code at all. For this reason,
When data is rewritten, it is not necessary to correct an error or an error detection code.

[0173]

According to the present invention, when data is rewritten, the amount of the total data to be rewritten including the CRC code is checked for each rewriting pattern. Then, among the patterns in which the data is rewritten, the pattern including the CRC code, which minimizes the total amount of data to be rewritten, is extracted, and the most suitable pattern is selected from the extracted patterns. The arrangement of data that can be rewritten is determined. For this reason, the amount of data rewriting generated by rewriting data becomes the smallest including the CRC code. Therefore, the rewriting with the watermark can be sufficiently performed by the firmware.

[Brief description of the drawings]

FIG. 1 is a schematic diagram used for describing data of a watermark.

FIG. 2 is a schematic diagram used for explaining offset information.

FIG. 3 is a schematic diagram used for explaining SCMC.

FIG. 4 is a schematic diagram used for explaining a packet.

FIG. 5 is a schematic diagram used for explaining a bit arrangement.

FIG. 6 is a schematic diagram illustrating an example of the number of rewrite patterns.

FIG. 7 is a schematic diagram illustrating an example of a rewrite pattern.

FIG. 8 is a schematic diagram illustrating an example of a rewriting pattern.

FIG. 9 is a schematic diagram used for describing a bit arrangement.

FIG. 10 is a schematic diagram of another example of the number of rewrite patterns.

FIG. 11 is a schematic diagram of another example of a rewriting pattern.

FIG. 12 is a schematic diagram used for describing a bit arrangement.

FIG. 13 is a schematic diagram used for describing a bit arrangement.

FIG. 14 is a schematic diagram of still another example of the number of rewrite patterns.

FIG. 15 is a schematic diagram of still another example of a rewrite pattern.

FIG. 16 is a schematic diagram of still another example of a rewrite pattern.

FIG. 17 is a schematic diagram of still another example of a rewrite pattern.

FIG. 18 is a schematic diagram used for describing a bit arrangement.

FIG. 19 is a schematic diagram used for explaining a bit arrangement.

FIG. 20 is a schematic diagram used for describing original content identification information.

FIG. 21 is a schematic diagram of still another example of a rewrite pattern.

FIG. 22 is a schematic diagram of still another example of a rewrite pattern.

FIG. 23 is a schematic diagram used for explaining a bit arrangement.

FIG. 24 is a block diagram of an example of a recording apparatus to which the present invention has been applied.

FIG. 25 is a block diagram illustrating an example of a watermark encoder.

FIG. 26 is a block diagram illustrating an example of a watermark decoder.

FIG. 27 is a block diagram illustrating an example of a playback device to which the present invention has been applied.

[Explanation of symbols]

2 ... a watermark adding circuit, 4 ... a watermark generating circuit, 46 ... a watermark detecting circuit, 4
7 ... Judgment circuit

 ────────────────────────────────────────────────── ─── Continuing on the front page (72) Inventor Tatsuya Inoguchi 7-35 Kita-Shinagawa, Shinagawa-ku, Tokyo F-term in Sony Corporation (reference) 5D044 AB05 BC03 CC04 DE03 DE12 DE42 DE49 DE50 DE68 GK17 HL08

Claims (84)

[Claims] 1. A data recording medium for recording data by adding an error correction code or an error detection code to predetermined data, wherein the predetermined data includes rewritable data;
Non-rewritable data, the amount of data rewriting caused by rewriting the rewritable data, and the error correction code or error detection code rewriting caused by rewriting the rewritable data. A data recording medium which extracts a pattern having the smallest sum with the amount and determines the arrangement of the rewritable data based on the extracted pattern. 2. A data recording medium for recording data by adding an error correction code or an error detection code to predetermined data, wherein the predetermined data includes rewritable data;
If the data that can be rewritten includes a first rewrite pattern and a second rewrite pattern, the data that cannot be rewritten includes the first rewrite pattern. After extracting a pattern that minimizes the sum of the amount of rewriting of the generated data and the amount of rewriting of the error correction code or the error detection code that occurs when rewriting by the first rewriting pattern occurs, The sum of the rewriting amount of data generated when rewriting by the second rewriting pattern occurs and the rewriting amount of error correction code or error detection code generated when rewriting by the second rewriting pattern occurs is the smallest. Extract a pattern that becomes smaller, and write with the extracted first rewrite pattern Rewriting of data that occurs when e occurs and the first
A pattern in which the total sum of the amount of rewriting of the error correction code or the error detection code generated when rewriting by the rewriting pattern of The rewriting is performed based on a pattern that minimizes the sum of the rewriting amount of the generated data and the rewriting amount of the error correction code or the error detection code that occurs when the rewriting by the second rewriting pattern occurs. A data recording medium for determining the arrangement of data to be obtained. 3. The information rewritten by the first rewriting pattern and the information rewritten by the second rewriting pattern include the information rewritten by the second rewriting pattern even when the rewriting by the first rewriting pattern occurs. 3. The data recording medium according to claim 2, including information that is commonly rewritten even when rewriting by a rewriting pattern occurs. 4. The information rewritten by the first rewrite pattern and the information rewritten by the second rewrite pattern include only when rewriting by the first rewrite pattern occurs or when the second rewrite pattern
3. The data recording medium according to claim 2, including information that can be rewritten only when rewriting according to the rewriting pattern is performed. 5. Rewriting of data caused by rewriting data that can be rewritten, both when rewriting by the first rewriting pattern and when rewriting by the second rewriting pattern occur. The arrangement of the rewritable data is determined so that the sum of the amount and the amount of rewriting of the error correction code or error detection code generated by rewriting the rewritable data is minimized. Item 3. A data recording medium according to Item 2. 6. When an area in which the unrewritable data is to be arranged in the predetermined data is determined, an area excluding an area determined as an area in which the unrewritable data is to be arranged. 3. The data recording medium according to claim 1, wherein an arrangement of the rewritable data is determined. 7. The rewriting amount of data generated by rewriting the rewritable data is equal to or more than the rewriting amount of an error correction code or an error detection code generated by rewriting the rewritable data. 3. The data recording medium according to 1 or 2. 8. The data recording medium according to claim 1, wherein the rewrite amount of the error correction code or the error detection code generated by rewriting the rewritable data is zero. 9. The data recording medium according to claim 1, wherein the error correction code or the error detection code is processed in bit units, and the arrangement of the rewritable data is determined in bit units. . 10. The data recording medium according to claim 1, wherein the error correction code or the error detection code is processed in byte units, and the arrangement of the rewritable data is determined in byte units. . 11. The data recording medium according to claim 1, wherein the error correction code or the error detection code uses a CRC (Cyclic Redundancy Check) code. 12. The data recording medium according to claim 1, wherein the rewritable data is one bit of information represented by two bits. 13. The data recording medium according to claim 1, wherein the rewritable data is two bits of information represented by two bits. 14. The data recording medium according to claim 1, wherein the rewritable data is one bit of information represented by two bits and one bit of information represented by one bit. 15. The data recording medium according to claim 1, wherein the rewritable data is two bits of information represented by two bits and one bit of information represented by one bit. 16. The data recording medium according to claim 1, wherein the predetermined data is embedded as additional information in the content data. 17. The data recording medium according to claim 16, wherein the additional information is copy management information and / or reproduction management information. 18. The data recording medium according to claim 17, wherein the copy management information can perform copy generation management. 19. The data recording medium according to claim 16, wherein said additional information is inserted into lower bits of said content data. 20. The data recording medium according to claim 16, wherein the additional information is inserted into a higher-order coefficient when the data of the content is compressed. 21. The data recording medium according to claim 16, wherein the additional information does not affect the content by using a masking effect. 22. A data recording method for recording data by adding an error correction code or an error detection code to predetermined data, wherein the predetermined data includes rewritable data and non-rewritable data. And the amount of rewriting of data generated by rewriting the rewritable data and the amount of error correction code or error detecting code generated by rewriting of the rewritable data. A data recording method in which a pattern having the smallest sum is extracted, and the arrangement of the rewritable data is determined based on the extracted pattern. 23. A data recording method for recording data by adding an error correction code or an error detection code to predetermined data, wherein the predetermined data includes rewritable data;
If the data that can be rewritten includes a first rewrite pattern and a second rewrite pattern, the data that cannot be rewritten includes the first rewrite pattern. After extracting a pattern that minimizes the sum of the amount of rewriting of the generated data and the amount of rewriting of the error correction code or the error detection code that occurs when rewriting by the first rewriting pattern occurs, The sum of the rewriting amount of data generated when rewriting by the second rewriting pattern occurs and the rewriting amount of error correction code or error detection code generated when rewriting by the second rewriting pattern occurs is the smallest. Extract a pattern that becomes smaller, and write with the extracted first rewrite pattern Rewriting of data that occurs when e occurs and the first
A pattern in which the total sum of the amount of rewriting of the error correction code or the error detection code generated when rewriting by the rewriting pattern of The rewriting is performed based on a pattern that minimizes the sum of the rewriting amount of the generated data and the rewriting amount of the error correction code or the error detection code that occurs when the rewriting by the second rewriting pattern occurs. A data recording method for determining the arrangement of data to be obtained. 24. The information rewritten by the first rewrite pattern and the information rewritten by the second rewrite pattern include the information rewritten by the second rewrite pattern even when the rewrite by the first rewrite pattern occurs. 24. The data recording method according to claim 23, further comprising information that is commonly rewritten when rewriting by a rewriting pattern occurs. 25. The information rewritten by the first rewrite pattern and the information rewritten by the second rewrite pattern include only when rewrite by the first rewrite pattern occurs or when the second rewrite pattern 24. The data recording method according to claim 23, further comprising information that is rewritten only when rewriting by the rewriting pattern is performed. 26. Rewriting of data caused by rewriting data that can be rewritten, both when rewriting by the first rewriting pattern occurs and when rewriting by the second rewriting pattern occurs. The arrangement of the rewritable data is determined so that the sum of the amount and the amount of rewriting of the error correction code or error detection code generated by rewriting the rewritable data is minimized. Item 24. The data recording method according to Item 23. 27. When an area in which the unrewritable data is to be arranged is determined in the predetermined data, an area excluding an area determined as an area in which the unrewritable data is to be arranged. 24. The data recording method according to claim 22, wherein an arrangement of the rewritable data is determined. 28. The rewriting amount of data generated by rewriting the rewritable data is equal to or more than the rewriting amount of an error correction code or an error detection code generated by rewriting the rewritable data. 24. The data recording method according to 22 or 23. 29. The data recording method according to claim 22, wherein the rewrite amount of the error correction code or the error detection code generated by rewriting the rewritable data is zero. 30. The data recording method according to claim 22, wherein the error correction code or the error detection code is processed in bit units, and the arrangement of the rewritable data is determined in bit units. . 31. The data recording method according to claim 22, wherein the error correction code or the error detection code is processed in byte units, and the arrangement of the rewritable data is determined in byte units. . 32. The data recording method according to claim 22, wherein the error correction code or the error detection code uses a CRC (Cyclic Redundancy Check) code. 33. The rewritable data is one bit of information represented by two bits.
Or the data recording method according to 23. 34. The rewritable data is two bits of information represented by two bits.
Or the data recording method according to 23. 35. The rewritable data is one bit of information represented by two bits and one bit of information represented by one bit.
Data recording method described in 1. 36. The data which can be rewritten is two bits of information represented by two bits and one bit of information represented by one bit.
Data recording method described in 1. 37. The data recording method according to claim 22, wherein the predetermined data is embedded in the content data as additional information. 38. The apparatus according to claim 37, wherein the additional information is copy management information and / or reproduction management information.
Data recording method described in 1. 39. The data recording method according to claim 38, wherein the copy management information enables copy generation management. 40. The data recording method according to claim 37, wherein said additional information is inserted into lower bits of said content data. 41. The data recording method according to claim 37, wherein the additional information is inserted into a higher-order coefficient when the data of the content is compressed. 42. The data recording method according to claim 37, wherein the additional information does not affect the content by using a masking effect. 43. A data recording apparatus for recording data by adding error correction or an error detection code to predetermined data, wherein the predetermined data includes rewritable data;
When the data that cannot be rewritten is included, and when the data that can be rewritten in the predetermined data needs to be rewritten, the data that can be rewritten is rewritten. It has means for rewriting a correction code or an error detection code, and the rewritable data is obtained by rewriting the rewritable data and the data rewriting amount generated by rewriting the rewritable data. A data recording apparatus that extracts a pattern that minimizes the sum of the generated error correction code or error detection code and the rewrite amount, and arranges the pattern at a position determined based on the extracted pattern. 44. A data recording apparatus for recording data by adding an error correction code or an error detection code to predetermined data, wherein the predetermined data includes rewritable data;
When the data that cannot be rewritten is included, and when the data that can be rewritten in the predetermined data needs to be rewritten, the data that can be rewritten is rewritten, and an error occurs when the data that can be rewritten is rewritten. Means for rewriting the correction code or the error detection code, and when the rewriteable data includes a first rewrite pattern and a second rewrite pattern, the rewriteable data is The smallest sum of the rewriting amount of data generated when rewriting by the first rewriting pattern occurs and the rewriting amount of error correction code or error detection code generated when rewriting by the first rewriting pattern occurs. After extracting such a pattern, the second rewrite pattern A pattern that minimizes the sum of the amount of data rewriting that occurs when rewriting due to the error occurs and the amount of error correction code or error detecting code that occurs when rewriting occurs using the second rewriting pattern. Is extracted, and the amount of data rewriting that occurs when rewriting is performed by the extracted first rewriting pattern and the first rewriting amount are calculated.
A pattern in which the total sum of the amount of rewriting of the error correction code or the error detection code generated when rewriting by the rewriting pattern of A position determined based on a pattern that minimizes the sum of the amount of rewriting of the generated data and the amount of rewriting of the error correction code or the error detection code that occurs when the rewriting by the second rewriting pattern occurs. A data recording device arranged to be located at 45. The information rewritten by the first rewrite pattern and the information rewritten by the second rewrite pattern include the second rewrite pattern even when the rewrite by the first rewrite pattern occurs. The data recording apparatus according to claim 44, further comprising information that is commonly rewritten when rewriting by a rewriting pattern occurs. 46. The information rewritten by the first rewriting pattern and the information rewritten by the second rewriting pattern include only when rewriting by the first rewriting pattern occurs or when the second rewriting pattern occurs. 45. The data recording apparatus according to claim 44, wherein the data recording apparatus includes information that is rewritten only when rewriting by the rewriting pattern is performed. 47. Rewriting of data caused by rewriting data that can be rewritten, both when rewriting by the first rewriting pattern occurs and when rewriting by the second rewriting pattern occurs. The arrangement of the rewritable data is determined so that the sum of the amount and the amount of rewriting of the error correction code or error detection code generated by rewriting the rewritable data is minimized. Item 45. The data recording device according to Item 44. 48. When an area in which the unrewritable data is to be arranged is determined in the predetermined data, an area excluding an area determined as an area in which the unrewritable data is to be arranged. 45. The data recording apparatus according to claim 43, wherein the arrangement of the data that can be rewritten is determined. 49. The rewriting amount of data generated by rewriting the rewritable data is equal to or more than the rewriting amount of an error correction code or an error detection code generated by rewriting the rewritable data. 45. The data recording device according to 43 or 44. 50. The data recording apparatus according to claim 43, wherein the rewrite amount of the error correction code or the error detection code generated by rewriting the rewritable data is zero. 51. The data recording apparatus according to claim 43, wherein an error correction code or an error detection code which is processed in bit units is used, and an arrangement of the rewritable data is determined in bit units. . 52. The data recording apparatus according to claim 43, wherein the error correction code or the error detection code is processed in byte units, and the arrangement of the rewritable data is determined in byte units. . 53. The data recording apparatus according to claim 43, wherein the error correction code or the error detection code uses a CRC (Cyclic Redundancy Check) code. 54. The data which can be rewritten is one bit of information represented by two bits.
Or the data recording device according to 44. 55. The data which can be rewritten is two bits of information represented by two bits.
Or the data recording device according to 44. 56. The rewritable data is one bit of information represented by two bits and one bit of information represented by one bit.
A data recording device according to claim 1. 57. The rewritable data is two bits of information represented by two bits and one bit of information represented by one bit.
A data recording device according to claim 1. 58. The data recording apparatus according to claim 43, wherein the predetermined data is embedded in the content data as additional information. 59. The data recording apparatus according to claim 58, wherein the additional information is copy management information and / or reproduction management information. 60. The data recording apparatus according to claim 59, wherein the copy management information enables copy generation management. 61. The data recording apparatus according to claim 58, wherein the additional information is inserted into lower bits of the content data. 62. The data recording apparatus according to claim 58, wherein the additional information is inserted into a higher-order coefficient when the data of the content is compressed. 63. The data recording apparatus according to claim 58, wherein the additional information does not affect the content by using a masking effect. 64. Content data to which an error correction code or an error detection code is added, wherein the predetermined data includes data that can be rewritten,
Non-rewritable data, the amount of data rewriting caused by rewriting the rewritable data, and the error correction code or error detection code rewriting caused by rewriting the rewritable data. Content data in which a pattern whose sum with the amount is minimized is extracted, and the arrangement of the rewritable data is determined based on the extracted pattern. 65. Content data to which an error correction code or an error detection code is added, wherein the predetermined data includes data that can be rewritten,
If the data that can be rewritten includes a first rewrite pattern and a second rewrite pattern, the data that cannot be rewritten includes the first rewrite pattern. After extracting a pattern that minimizes the sum of the amount of rewriting of the generated data and the amount of rewriting of the error correction code or the error detection code that occurs when rewriting by the first rewriting pattern occurs, The sum of the rewriting amount of data generated when rewriting by the second rewriting pattern occurs and the rewriting amount of error correction code or error detection code generated when rewriting by the second rewriting pattern occurs is the smallest. Extract a pattern that becomes smaller, and write with the extracted first rewrite pattern Rewriting of data that occurs when e occurs and the first
A pattern in which the total sum of the amount of rewriting of the error correction code or the error detection code generated when rewriting by the rewriting pattern of The rewriting is performed based on a pattern that minimizes the sum of the rewriting amount of the generated data and the rewriting amount of the error correction code or the error detection code that occurs when the rewriting by the second rewriting pattern occurs. Content data that determines the arrangement of data to be obtained. 66. The information rewritten by the first rewrite pattern and the information rewritten by the second rewrite pattern include the information rewritten by the second rewrite pattern even when the rewrite by the first rewrite pattern occurs. 66. The content data according to claim 65, including information that is commonly rewritten when rewriting by a rewriting pattern occurs. 67. The information rewritten by the first rewriting pattern and the information rewritten by the second rewriting pattern include only when rewriting by the first rewriting pattern occurs or when the second rewriting pattern 66. The content data according to claim 65, including information that can be rewritten only when rewriting according to the rewriting pattern occurs. 68. Rewriting of data caused by rewriting data that can be rewritten, both when rewriting by the first rewriting pattern occurs and when rewriting by the second rewriting pattern occurs. The arrangement of the rewritable data is determined so that the sum of the amount and the amount of rewriting of the error correction code or error detection code generated by rewriting the rewritable data is minimized. Item 64. The content data according to item 64 or 65. 69. When an area in which the unrewritable data is to be arranged in the predetermined data is determined, an area excluding an area determined as an area in which the unrewritable data is to be arranged. 66. The content data according to claim 64, wherein the arrangement of the data that can be rewritten is determined. 70. A rewriting amount of data generated by rewriting the rewritable data is equal to or larger than an error correction code or an error detection code generated by rewriting of the rewritable data. 64. Content data according to 64 or 65. 71. The content data according to claim 64, wherein the amount of rewriting of an error correction code or an error detection code generated by rewriting the rewritable data is zero. 72. Content data according to claim 64 or 65, wherein the error correction or error detection code processed in bit units is used, and the arrangement of the rewritable data is determined in bit units. 73. The content data according to claim 64, wherein the error correction or error detection code is processed in units of bytes, and the arrangement of the rewritable data is determined in units of bytes. 74. The content data according to claim 64, wherein the error correction or error detection code uses a CRC (Cyclic Redundancy Check) code. 75. The data that can be rewritten is one bit of information represented by two bits.
Or the content data described in 65. 76. The data that can be rewritten is two bits of information represented by two bits.
Or the content data described in 65. 77. The data which can be rewritten is one bit of information represented by two bits and one bit of information represented by one bit.
Content data described in. 78. The rewritable data is two bits of information represented by two bits and one bit of information represented by one bit.
Content data described in. 79. The content data according to claim 64, wherein the predetermined data is embedded in the content data as additional information. 80. The apparatus according to claim 79, wherein the additional information is copy management information and / or reproduction management information.
Content data described in. 81. The content data according to claim 80, wherein said copy management information enables copy generation management. 82. Content data according to claim 79, wherein said additional information is inserted into lower bits of said content data. 83. The content data according to claim 79, wherein said additional information is inserted into a higher-order coefficient when said content data is compressed. 84. The content data according to claim 79, wherein the additional information does not affect the content by using a masking effect.