# US 2004/0201504 A1 · Information encoding apparatus, information encoding method, information re-encoding apparatus and information re-encoding method > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2004/0201504 A1 - Document ID: US20040201504A1 - Status: Published application - Kind: A1 - Application number: 10/798,846 - Filed: 2004-03-11 - Published: 2004-10-14 - Earliest claimed: 2003-04-10 - Assignees: Matsushita Electric Industrial Co., Ltd. - Inventors: Yoshikazu Yamamoto; Hisae Tanaka; Motoshi Ito - Web page: https://patentgrep.com/patent/US20040201504A1 ## CPC - G11B 20/10: Digital recording or reproducing - G11B: INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER (recording measured values in a way that does not require playback through a transducer G01D9/00; recording or playback apparatus using mechanically marked tape, e.g. punched paper tape, or using unit records, e.g. punched or magnetically marked cards G06K; transferring data from one type of record carrier to another G06K1/18; circuits for coupling output of reproducer to radio receiver H04B1/20; gramophone pick-ups or like acoustic electromechanical transducers or circuits therefor H04R) ## Abstract An information encoding apparatus for encoding N pieces of information, the information encoding apparatus includes a scrambling pattern generation section for generating M scrambling patterns (N>M≧1; where M and N are each an integer); a scrambled information generation section for applying, to each of the N pieces of information, one corresponding scrambling pattern among the M scrambling patterns so as to generate N pieces of scrambled information; and an encoded information generation section for supplying the N pieces of scrambled information with N parities, respectively, so as to generate encoded information. Each of at least one of the M scrambling patterns is applied to two or more of the N pieces of information. ## Claims ### Claim 1 An information encoding apparatus for encoding N pieces of information, the information encoding apparatus comprising: a scrambling pattern generation section for generating M scrambling patterns (N>M≧1; where M and N are each an integer); a scrambled information generation section for applying, to each of the N pieces of information, one corresponding scrambling pattern among the M scrambling patterns so as to generate N pieces of scrambled information; and an encoded information generation section for supplying the N pieces of scrambled information with N parities, respectively, so as to generate encoded information; wherein each of at least one of the M scrambling patterns is applied to two or more of the N pieces of information. ### Claim 2 (depends on 1) An information encoding apparatus according to claim 1, wherein the M is a divisor of N, and the scrambled information generation section applies one corresponding scrambling pattern among the M scrambling patterns to each of the N pieces of information such that the M scrambling patterns are repeated N/M times, so as to generate the N pieces of scrambled information. ### Claim 3 (depends on 1) An information encoding apparatus according to claim 1, further comprising a first storage section for storing the N pieces of scrambled information and the N parities in order to supply the N pieces of scrambled information with the N parities. ### Claim 4 (depends on 1) An information encoding apparatus according to claim 1, further comprising a second storage section for storing the M scrambling patterns. ### Claim 5 (depends on 1) An information encoding apparatus according to claim 1, wherein the encoded information generation section is a division circuit. ### Claim 6 (depends on 1) An information encoding apparatus according to claim 1, wherein the encoded information generation section generates the N parities by erasure correction. ### Claim 7 (depends on 1) An information encoding apparatus according to claim 1, wherein N is 32 and M is 1. ### Claim 8 An information encoding method for encoding N pieces of information, the information encoding method comprising the steps of: (a) generating M scrambling patterns (N>M≧1; where M and N are each an integer); (b) applying, to each of the N pieces of information, one corresponding scrambling pattern among the M scrambling patterns, thereby generating N pieces of scrambled information; and (c) supplying the N pieces of scrambled information with N parities, respectively, thereby generating encoded information; wherein each of at least one of the M scrambling patterns is applied to two or more of the N pieces of information. ### Claim 9 (depends on 8) An information encoding method according to claim 8, wherein the M is a divisor of N, and step (b) includes the step of applying one corresponding scrambling pattern among the M scrambling patterns to each of the N pieces of information such that the M scrambling patterns are repeated N/M times, thereby generating the N pieces of scrambled information. ### Claim 10 (depends on 8) An information encoding method according to claim 8, further comprising the step of storing the N pieces of scrambled information and the N parities in order to supply the N pieces of scrambled information with the N parities. ### Claim 11 (depends on 8) An information encoding method according to claim 8, further comprising the step of storing the M scrambling patterns. ### Claim 12 (depends on 8) An information encoding method according to claim 8, wherein step (c) includes the step of generating the N parities by division. ### Claim 13 (depends on 8) An information encoding method according to claim 8, wherein step (c) includes the step of generating the N parities by erasure correction. ### Claim 14 (depends on 8) An information encoding method according to claim 8, wherein N is 32 and M is 1. ### Claim 15 An information re-encoding apparatus for re-encoding a plurality of pieces of first encoded information into a plurality of pieces of second encoded information, wherein: the plurality of pieces of first encoded information include a plurality of first scrambled information scrambled by performing an arithmetic operation on a plurality of first scrambling patterns with respect to a plurality of pieces of information by a first method; the plurality of pieces of second encoded information include a plurality of pieces of second scrambled information scrambled by performing an arithmetic operation on a plurality of second scrambling patterns with respect to the plurality of pieces of information by the first method, and a plurality of second parities, the information re-encoding apparatus comprising: a third scrambling pattern generation section for performing an arithmetic operation on the plurality of first scrambling patterns with respect to the plurality of second scrambling patterns by a second method, so as to generate a plurality of third scrambling patterns; a scrambled information generation section for performing an arithmetic operation on the plurality of third scrambling patterns with respect to the plurality of pieces of first scrambled information by the first method, so as to generate the plurality of pieces of second scrambled information; and an encoded information generation section for supplying the plurality of pieces of second scrambled information with the plurality of second parities, so as to generate the plurality of pieces of second encoded information; wherein the arithmetic operations performed by the first method and the second method fulfill (A∘B) [Circlesolid]B=A, where ∘ represents a first operator representing the arithmetic operation to be performed by the first method, the [Circlesolid] represents a second operator representing the arithmetic operation to be performed by the second method, and A and B each represent an arbitrary value. ### Claim 16 (depends on 15) An information re-encoding apparatus according to claim 15, further comprising a first storage section for storing the plurality of pieces of second scrambled information and the plurality of second parities in order to supply the plurality of pieces of second scrambled information with the plurality of second parities. ### Claim 17 (depends on 15) An information re-encoding apparatus according to claim 15, further comprising a second storage section for storing the plurality of third scrambling patterns and the plurality of third parities. ### Claim 18 (depends on 15) An information re-encoding apparatus according to claim 15, wherein: the plurality of pieces of first encoded information include a plurality of first parities; and the encoded information generation section includes: a third parity generation section for generating a plurality of third parities in correspondence with the plurality of third scrambling patterns; and a second parity generation section for performing an arithmetic operation on the plurality of third parities with respect to the plurality of first parities by the first method, so as to generate the plurality of second parities. ### Claim 19 (depends on 18) An information re-encoding apparatus according to claim 18, wherein the third parity generation section is a division circuit. ### Claim 20 (depends on 18) An information re-encoding apparatus according to claim 18, wherein the third parity generation section generates the plurality of third parities by erasure correction. ### Claim 21 (depends on 18) An information re-encoding apparatus according to claim 18, wherein: the plurality of pieces of first scrambled information are N pieces of information, the plurality of third scrambling patterns are M pieces of information (N>M≧1; M and N are each an integer; and M is a divisor of N), the plurality of first parities are N pieces of information, and the plurality of third parities are M pieces of information; the scrambled information generation section performs an arithmetic operation on one corresponding third scrambling pattern among the plurality of third scrambling patterns with respect to each of the plurality of pieces of first scrambled information by the first method, such that the plurality of third scrambling patterns are repeated N/M times, so as to generate N pieces of second scrambled information; and the second parity generation section performs an arithmetic operation on one corresponding third parity among the plurality of third parities with respect to each of the plurality of first parities by the first method, such that the plurality of third parities are repeated N/M times, so as to generate N pieces of second parities. ### Claim 22 (depends on 21) An information re-encoding apparatus according to claim 21, wherein N is 32 and M is 2. ### Claim 23 An information re-encoding method for re-encoding a plurality of pieces of first encoded information into a plurality of pieces of second encoded information, wherein: the plurality of pieces of first encoded information include a plurality of first scrambled information scrambled by performing an arithmetic operation on a plurality of first scrambling patterns with respect to a plurality of pieces of information by a first method; the plurality of pieces of second encoded information include a plurality of pieces of second scrambled information scrambled by performing an arithmetic operation on a plurality of second scrambling patterns with respect to the plurality of pieces of information by the first method, and a plurality of second parities, the information re-encoding method comprising the steps of: (a) performing an arithmetic operation on the plurality of first scrambling patterns with respect to the plurality of second scrambling patterns by a second method, thereby generating a plurality of third scrambling patterns; (b) performing an arithmetic operation on the plurality of third scrambling patterns with respect to the plurality of pieces of first scrambled information by the first method, thereby generating the plurality of pieces of second scrambled information; and (c) supplying the plurality of pieces of second scrambled information with the plurality of second parities, thereby generating the plurality of pieces of second encoded information; wherein the arithmetic operations performed by the first method and the second method fulfill (A∘B) [Circlesolid]B=A, where β represents a first operator representing the arithmetic operation to be performed by the first method, the [Circlesolid] represents a second operator representing the arithmetic operation to be performed by the second method, and A and B each represent an arbitrary value. ### Claim 24 (depends on 23) An information re-encoding method according to claim 23, further comprising the step of storing the plurality of pieces of second scrambled information and the plurality of second parities in order to supply the plurality of pieces of second scrambled information with the plurality of second parities. ### Claim 25 (depends on 23) An information re-encoding method according to claim 23, further comprising the step of storing the plurality of third scrambling patterns and the plurality of third parities. ### Claim 26 (depends on 23) An information re-encoding method according to claim 23, wherein: the plurality of pieces of first encoded information include a plurality of first parities; and step (c) includes the steps of: (c-1) generating a plurality of third parities in correspondence with the plurality of third scrambling patterns; and (c-2) performing an arithmetic operation on the plurality of third parities with respect to the plurality of first parities by the first method, thereby generating the plurality of second parities. ### Claim 27 (depends on 26) An information re-encoding method according to claim 26, wherein step (c-1) includes the step of generating the plurality of third parities by division. ### Claim 28 (depends on 26) An information re-encoding method according to claim 26, wherein step (c-1) includes the step of generating the plurality of third parities by erasure correction. ### Claim 29 (depends on 26) An information re-encoding method according to claim 26, wherein: the plurality of pieces of first scrambled information are N pieces of information, the plurality of third scrambling patterns are M pieces of information (N>M≧1; M and N are each an integer; and M is a divisor of N), the plurality of first parities are N pieces of information, and the plurality of third parities are M pieces of information; step (b) includes the step of performing an arithmetic operation on one corresponding third scrambling pattern among the plurality of third scrambling patterns with respect to each of the plurality of pieces of first scrambled information by the first method, such that the plurality of third scrambling patterns are repeated N/M times, thereby generating N pieces of second scrambled information; and step (c-2) includes the step of performing an arithmetic operation on one corresponding third parity among the plurality of third parities with respect to each of the plurality of first parities by the first method, such that the plurality of third parities are repeated N/M times, thereby generating N pieces of second parities. ### Claim 30 (depends on 29) An information re-encoding method according to claim 29, wherein N is 32 and M is 2.