HL7 Terminology (THO)
3.0.0 - Publication

This page is part of the HL7 Terminology (v3.0.0: Release) based on FHIR R4. The current version which supercedes this version is 5.2.0. For a full list of available versions, see the Directory of published versions

: CompressionAlgorithm - JSON Representation

Raw json | Download


{
  "resourceType" : "CodeSystem",
  "id" : "v3-CompressionAlgorithm",
  "language" : "en",
  "text" : {
    "status" : "generated",
    "div" : "<div xmlns=\"http://www.w3.org/1999/xhtml\" xml:lang=\"en\" lang=\"en\"><p><b>Properties</b></p><table class=\"grid\"><tr><td><b>Code</b></td><td><b>URL</b></td><td><b>Description</b></td><td><b>Type</b></td></tr><tr><td>Specializes</td><td/><td>The child code is a more narrow version of the concept represented by the parent code.  I.e. Every child concept is also a valid parent concept.  Used to allow determination of subsumption.  Must be transitive, irreflexive, antisymmetric.</td><td>Coding</td></tr><tr><td>Generalizes</td><td/><td>Inverse of Specializes.  Only included as a derived relationship.</td><td>Coding</td></tr><tr><td>internalId</td><td>http://terminology.hl7.org/CodeSystem/utg-concept-properties#v3-internal-id</td><td>The internal identifier for the concept in the HL7 Access database repository.</td><td>code</td></tr><tr><td>howApplies</td><td>http://terminology.hl7.org/CodeSystem/utg-concept-properties#v3-how-applies</td><td>Haven't a clue!</td><td>string</td></tr><tr><td>status</td><td>http://hl7.org/fhir/concept-properties#status</td><td>Designation of a concept's state. Normally is not populated unless the state is retired.</td><td>code</td></tr></table><p>This code system http://terminology.hl7.org/CodeSystem/v3-CompressionAlgorithm defines the following codes:</p><table class=\"codes\"><tr><td style=\"white-space:nowrap\"><b>Code</b></td><td><b>Display</b></td><td><b>Definition</b></td><td><b>internalId</b></td><td><b>howApplies</b></td><td><b>status</b></td></tr><tr><td style=\"white-space:nowrap\">BZ<a name=\"v3-CompressionAlgorithm-BZ\"> </a></td><td>bzip</td><td>bzip-2 compression format. See \\[http://www.bzip.org/\\] for more information.</td><td>23535</td><td/><td>active</td></tr><tr><td style=\"white-space:nowrap\">DF<a name=\"v3-CompressionAlgorithm-DF\"> </a></td><td>deflate</td><td>The deflate compressed data format as specified in RFC 1951 \\[http://www.ietf.org/rfc/rfc1951.txt\\].</td><td>10621</td><td>mandatory</td><td>active</td></tr><tr><td style=\"white-space:nowrap\">GZ<a name=\"v3-CompressionAlgorithm-GZ\"> </a></td><td>gzip</td><td>A compressed data format that is compatible with the widely used GZIP utility as specified in RFC 1952 \\[http://www.ietf.org/rfc/rfc1952.txt\\] (uses the deflate algorithm).</td><td>10622</td><td>other</td><td>active</td></tr><tr><td style=\"white-space:nowrap\">Z<a name=\"v3-CompressionAlgorithm-Z\"> </a></td><td>compress</td><td>Original UNIX compress algorithm and file format using the LZC algorithm (a variant of LZW). Patent encumbered and less efficient than deflate.</td><td>10624</td><td>deprecated</td><td>active</td></tr><tr><td style=\"white-space:nowrap\">Z7<a name=\"v3-CompressionAlgorithm-Z7\"> </a></td><td>Z7</td><td>7z compression file format. See \\[http://www.7-zip.org/7z.html\\] for more information.</td><td>23536</td><td/><td>active</td></tr><tr><td style=\"white-space:nowrap\">ZL<a name=\"v3-CompressionAlgorithm-ZL\"> </a></td><td>zlib</td><td>A compressed data format that also uses the deflate algorithm. Specified as RFC 1950 \\[http://www.ietf.org/rfc/rfc1952.txt\\]</td><td>10623</td><td>other</td><td>active</td></tr></table></div>"
  },
  "url" : "http://terminology.hl7.org/CodeSystem/v3-CompressionAlgorithm",
  "identifier" : [
    {
      "system" : "urn:ietf:rfc:3986",
      "value" : "urn:oid:2.16.840.1.113883.5.1009"
    }
  ],
  "version" : "2.0.0",
  "name" : "CompressionAlgorithm",
  "title" : "CompressionAlgorithm",
  "status" : "active",
  "date" : "2019-03-20",
  "publisher" : "Health Level 7",
  "contact" : [
    {
      "name" : "Health Level Seven"
    }
  ],
  "hierarchyMeaning" : "is-a",
  "content" : "complete",
  "property" : [
    {
      "extension" : [
        {
          "url" : "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-symmetry",
          "valueCode" : "antisymmetric"
        },
        {
          "url" : "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-transitivity",
          "valueCode" : "transitive"
        },
        {
          "url" : "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-reflexivity",
          "valueCode" : "irreflexive"
        },
        {
          "url" : "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-isNavigable",
          "valueBoolean" : true
        },
        {
          "url" : "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-relationshipKind",
          "valueCode" : "Specializes"
        },
        {
          "url" : "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-inverseName",
          "valueString" : "Generalizes"
        }
      ],
      "code" : "Specializes",
      "description" : "The child code is a more narrow version of the concept represented by the parent code.  I.e. Every child concept is also a valid parent concept.  Used to allow determination of subsumption.  Must be transitive, irreflexive, antisymmetric.",
      "type" : "Coding"
    },
    {
      "extension" : [
        {
          "url" : "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-symmetry",
          "valueCode" : "antisymmetric"
        },
        {
          "url" : "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-transitivity",
          "valueCode" : "transitive"
        },
        {
          "url" : "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-reflexivity",
          "valueCode" : "irreflexive"
        },
        {
          "url" : "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-isNavigable",
          "valueBoolean" : true
        },
        {
          "url" : "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-relationshipKind",
          "valueCode" : "Generalizes"
        },
        {
          "url" : "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-inverseName",
          "valueString" : "Specializes"
        }
      ],
      "code" : "Generalizes",
      "description" : "Inverse of Specializes.  Only included as a derived relationship.",
      "type" : "Coding"
    },
    {
      "code" : "internalId",
      "uri" : "http://terminology.hl7.org/CodeSystem/utg-concept-properties#v3-internal-id",
      "description" : "The internal identifier for the concept in the HL7 Access database repository.",
      "type" : "code"
    },
    {
      "code" : "howApplies",
      "uri" : "http://terminology.hl7.org/CodeSystem/utg-concept-properties#v3-how-applies",
      "description" : "Haven't a clue!",
      "type" : "string"
    },
    {
      "code" : "status",
      "uri" : "http://hl7.org/fhir/concept-properties#status",
      "description" : "Designation of a concept's state. Normally is not populated unless the state is retired.",
      "type" : "code"
    }
  ],
  "concept" : [
    {
      "code" : "BZ",
      "display" : "bzip",
      "definition" : "bzip-2 compression format. See \\[http://www.bzip.org/\\] for more information.",
      "property" : [
        {
          "code" : "status",
          "valueCode" : "active"
        },
        {
          "code" : "internalId",
          "valueCode" : "23535"
        }
      ]
    },
    {
      "code" : "DF",
      "display" : "deflate",
      "definition" : "The deflate compressed data format as specified in RFC 1951 \\[http://www.ietf.org/rfc/rfc1951.txt\\].",
      "property" : [
        {
          "code" : "status",
          "valueCode" : "active"
        },
        {
          "code" : "internalId",
          "valueCode" : "10621"
        },
        {
          "code" : "howApplies",
          "valueString" : "mandatory"
        }
      ]
    },
    {
      "code" : "GZ",
      "display" : "gzip",
      "definition" : "A compressed data format that is compatible with the widely used GZIP utility as specified in RFC 1952 \\[http://www.ietf.org/rfc/rfc1952.txt\\] (uses the deflate algorithm).",
      "property" : [
        {
          "code" : "status",
          "valueCode" : "active"
        },
        {
          "code" : "internalId",
          "valueCode" : "10622"
        },
        {
          "code" : "howApplies",
          "valueString" : "other"
        }
      ]
    },
    {
      "code" : "Z",
      "display" : "compress",
      "definition" : "Original UNIX compress algorithm and file format using the LZC algorithm (a variant of LZW). Patent encumbered and less efficient than deflate.",
      "property" : [
        {
          "code" : "status",
          "valueCode" : "active"
        },
        {
          "code" : "internalId",
          "valueCode" : "10624"
        },
        {
          "code" : "howApplies",
          "valueString" : "deprecated"
        }
      ]
    },
    {
      "code" : "Z7",
      "display" : "Z7",
      "definition" : "7z compression file format. See \\[http://www.7-zip.org/7z.html\\] for more information.",
      "property" : [
        {
          "code" : "status",
          "valueCode" : "active"
        },
        {
          "code" : "internalId",
          "valueCode" : "23536"
        }
      ]
    },
    {
      "code" : "ZL",
      "display" : "zlib",
      "definition" : "A compressed data format that also uses the deflate algorithm. Specified as RFC 1950 \\[http://www.ietf.org/rfc/rfc1952.txt\\]",
      "property" : [
        {
          "code" : "status",
          "valueCode" : "active"
        },
        {
          "code" : "internalId",
          "valueCode" : "10623"
        },
        {
          "code" : "howApplies",
          "valueString" : "other"
        }
      ]
    }
  ]
}