1. A visualization apparatus comprising:
a memory configured to store a circulation model in which a vascular network, of an organ, having a diameter equal to or smaller than a predetermined value is defined on a two-dimensional plane, and a simulation result of a blood flow in the vascular network of the circulation model; and
a processor configured to perform a procedure including:
transforming the circulation model into a three-dimensional structure including the vascular network located on a cylindrical surface of a cylinder, and
displaying the simulation result on the three-dimensional structure.
2. The visualization apparatus according to claim 1, wherein
the procedure further includes
creating the cylinder having a circumferential length of the cylindrical surface that is equal to a width of the circulation model in an orthogonal direction to a blood flow direction from an artery side to a vein side, and
locating a blood capillary on the cylinder.
3. The visualization apparatus according to claim 1, wherein
the circulation model is a microcirculation model having a structure of an arteriole, a venule, and a blood capillary between the arteriole and the venule, and
the procedure further includes locating the vascular network having a structure of the blood capillary on the cylindrical surface.
4. A visualization method comprising:
transforming, by a processor, a circulation model in which a vascular network, of an organ, having a diameter equal to or smaller than a predetermined value is defined on a plane, to a three-dimensional structure including the vascular network located on a cylindrical surface of a cylinder; and
displaying a simulation result of a blood flow in the vascular network of the circulation model, on the three-dimensional structure.
5. A non-transitory computer-readable storage medium storing a computer program that causes a computer to perform a procedure, the procedure comprising:
transforming a circulation model in which a vascular network, of an organ, having a diameter equal to or smaller than a predetermined value is defined on a plane, into a three-dimensional structure including the vascular network located on a cylindrical surface of a cylinder; and
displaying a simulation result of a blood flow in the vascular network of the circulation model, on the three-dimensional structure.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. Method of decoding possibly mutilated codewords (r) of a code (C) into information words (m\u2032) comprising information symbols (m\u20321, m\u20322, . . . , m\u2032k), said information words (m\u2032) being encoded into codewords (c) of said code (C), comprising the steps of:
providing a mechanism having a minimum Hamming distance for at least one subcode (C\u2032) of said code (C) that is larger than the minimum Hamming distance of said code (C), wherein said information words (m\u2032) are encoded into said codewords (c) using said mechanism;
decoding said possibly mutilated codewords (r) into codewords (r\u2032),
reconstructing information symbols (m\u20321, m2, . . . , m\u2032k) from said codewords (r\u2032),
comparing said reconstruct information symbols (m\u20321, m\u20322, . . . , m\u2032k) with information symbols (m1) known a priori before decoding, and
verifying decoding errors based on the result of said comparison.
2. Method according to claim 1, wherein said information symbols are reconstructed by syndrome forming.
3. Method according to claim 1, wherein said information words (m\u2032) are encoded into said codewords (c) using a generator matrix (G) providing an enhanced error correction capability if at least one information symbol (m\u20321) is known a priori before decoding.
4. Method according to claim 3, wherein said generator matrix (G) is selected such that the minimum Hamming distance of at least one subcode (C\u2032) of said code (C) is larger than the minimum Hamming distance of said code (C) and that a subcode generator matrix (G\u2032) of said subcode (C\u2032) derives from said generator matrix (G) of said code (C) by omitting the at least one row from said generator matrix (G) corresponding to said at least one a priori known information symbol (m\u20321,).
5. Method according to claim 3, wherein the contribution of said at least one a priori known information symbol (m1) included in said possibly mutilated codeword (r) is taken into account for decoding said possibly mutilated codeword (r) with enhanced error correcting capabilities.
6. Method according to claim 1, wherein address word (a) are encoded into said information symbols (in) such that address words (a1) comprising addresses being close to each other share a plurality of information symbols.
7. Method according to claim 6, wherein said method is used for encoding address words used in Digital Video Recording (DVR), in particular for encoding address words of wobble addresses.
8. Apparatus for decoding possibly mutilated codewords (r) of a code (C) into information words (m\u2032) comprising information symbols (m\u20321, m\u20322, . . . , m\u2032k), said information words (m\u2032) being encoded into codewords (c) of said code (C), wherein a mechanism having a minimum Hamming distance for at least one subcode (C\u2032) of said code (C) that is larger than the minimum Hamming distance of said code (C), wherein said information words (m\u2032) are encoded into said codewords (c) using said mechanism; comprising:
means for decoding said possibly mutilated codewords (r) into codewords (r\u2032),
means for reconstructing information symbols (m\u20321, m\u20322, . . . , m\u2032k) from said codewords (r\u2032),
means for comparing said reconstruct information symbols (m\u20321, m\u20322, . . . , m\u2032k) with information symbols (m1) known a priori before decoding, and
means for verifying decoding errors based on the result of said comparison.
9. Computer code executable on a computer to perform the steps of the method of claim 1.
10. The apparatus according to claim 8, wherein said information symbols are reconstructed by syndrome forming.
11. The apparatus according to claim 8, wherein said information words (m\u2032) are encoded into said codewords (c) using a generator matrix (G) providing an enhanced error correction capability if at least one information symbol (m\u20321) is known a priori before decoding.
12. The apparatus according to claim 11, wherein said generator matrix (G) is selected such that the minimum Harmning distance of at least one subcode (C\u2032) of said code (C) is larger than the minimum Hamming distance of said code (C) and that a subcode generator matrix (G\u2032) of said subcode (C\u2032) derives from said generator matrix (G) of said code (C) by omitting the at least one row from said generator matrix (G) corresponding to said at least one a priori known information symbol (m\u20321,).
13. The apparatus according to claim 11, wherein the contribution of said at least one a priori known information symbol (m1) included in said possibly mutilated codeword (r) is taken into account for decoding said possibly mutilated codeword (r) with enhanced error correcting capabilities.
14. The apparatus according to claim 8, wherein address word (a) are encoded into said information symbols (m) such that address words (a1) comprising addresses being close to each other share a plurality of information symbols.
15. The apparatus according to claim 14, wherein said method is used for encoding address words used in Digital Video Recording (DVR), in particular for encoding address words of wobble addresses.
16. A method of decoding codewords (r) of a code (C) into information words (m\u2032) including information symbols (m\u20321, m\u20322, . . . , m\u2032k), said information words (m\u2032) being encoded into codewords (c) of said code (C), wherein said information words (m\u2032) are encoded into said codewords (c) using a generator matrix (G) comprising the steps of:
decoding said codewords (r) into codewords (r\u2032),
reconstructing information symbols (m\u20321, m\u20322, . . . , m\u2032k) from said codewords (r\u2032),
comparing said reconstruct information symbols (m\u20321, m\u20322, . . . , m\u2032k) with at least one information symbol known before decoding, and
verifying decoding errors based on the result of said comparison,
wherein said generator matrix (G) is selected such that the minimum Hamming distance of at least one subcode (C\u2032) of said code (C) is larger than the minimum Hamming distance of said code (C) and that a subcode generator matrix (G\u2032) of said subcode (C\u2032) derives from said generator matrix (G) of said code (C) by omitting the at least one row from said generator matrix (G) corresponding to said at least one known information symbol (m\u20321,).
17. The method according to claim 16, wherein said information symbols are reconstructed by syndrome forming.
18. The method according to claim 16, wherein the contribution of said at least one known information symbol (m1) included in said possibly mutilated codeword (r) is taken into account for decoding said possibly mutilated codeword (r) with enhanced error correcting capabilities.
19. The method according to claim 16, wherein address word (a) are encoded into said information symbols (m) such that address words (a1) comprising addresses being close to each other share a plurality of information symbols.