http://terminology.hl7.org/CodeSystem/v3-CompressionAlgorithm|3.0.0

{
  "description" : "Type of compression algorithm used",
  "compose" : null,
  "package" : "hl7.terminology.r5@6.3.0",
  "date" : "2019-03-20T00:00:00Z",
  "publisher" : "Health Level Seven International",
  "content" : "complete",
  "property" : [ {
    "code" : "Specializes",
    "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" : "Specializes"
    }, {
      "url" : "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-inverseName",
      "valueString" : "Generalizes"
    } ],
    "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."
  }, {
    "code" : "Generalizes",
    "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"
    } ],
    "description" : "Inverse of Specializes.  Only included as a derived relationship."
  }, {
    "uri" : "http://terminology.hl7.org/CodeSystem/utg-concept-properties#v3-internal-id",
    "code" : "internalId",
    "type" : "code",
    "description" : "The internal identifier for the concept in the HL7 Access database repository."
  }, {
    "uri" : "http://terminology.hl7.org/CodeSystem/utg-concept-properties#v3-how-applies",
    "code" : "howApplies",
    "type" : "string",
    "description" : "Haven't a clue!"
  }, {
    "uri" : "http://hl7.org/fhir/concept-properties#status",
    "code" : "status",
    "type" : "code",
    "description" : "Designation of a concept's state. Normally is not populated unless the state is retired."
  } ],
  "name" : "CompressionAlgorithm",
  "copyright" : "This material derives from the HL7 Terminology THO. THO is copyright ©1989+ Health Level Seven International and is made available under the CC0 designation. For more licensing information see: https://terminology.hl7.org/license.html",
  "experimental" : false,
  "resourceType" : "CodeSystem",
  "title" : "CompressionAlgorithm",
  "supliment" : null,
  "status" : "active",
  "language" : "en",
  "hierarchyMeaning" : "is-a",
  "id" : "0f5e62d0-dc2a-532d-8e5a-68b6b95377df",
  "url" : "http://terminology.hl7.org/CodeSystem/v3-CompressionAlgorithm",
  "identifier" : [ {
    "value" : "urn:oid:2.16.840.1.113883.5.1009",
    "system" : "urn:ietf:rfc:3986"
  } ],
  "concept" : [ {
    "code" : "BZ",
    "display" : "bzip",
    "property" : [ {
      "code" : "status",
      "valueCode" : "active"
    }, {
      "code" : "internalId",
      "valueCode" : "23535"
    } ],
    "definition" : "bzip-2 compression format. See \\[http://www.bzip.org/\\] for more information."
  }, {
    "code" : "DF",
    "display" : "deflate",
    "property" : [ {
      "code" : "status",
      "valueCode" : "active"
    }, {
      "code" : "internalId",
      "valueCode" : "10621"
    }, {
      "code" : "howApplies",
      "valueString" : "mandatory"
    } ],
    "definition" : "The deflate compressed data format as specified in RFC 1951 \\[http://www.ietf.org/rfc/rfc1951.txt\\]."
  }, {
    "code" : "GZ",
    "display" : "gzip",
    "property" : [ {
      "code" : "status",
      "valueCode" : "active"
    }, {
      "code" : "internalId",
      "valueCode" : "10622"
    }, {
      "code" : "howApplies",
      "valueString" : "other"
    } ],
    "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)."
  }, {
    "code" : "Z",
    "display" : "compress",
    "property" : [ {
      "code" : "status",
      "valueCode" : "active"
    }, {
      "code" : "internalId",
      "valueCode" : "10624"
    }, {
      "code" : "howApplies",
      "valueString" : "deprecated"
    } ],
    "definition" : "Original UNIX compress algorithm and file format using the LZC algorithm (a variant of LZW). Patent encumbered and less efficient than deflate."
  }, {
    "code" : "Z7",
    "display" : "Z7",
    "property" : [ {
      "code" : "status",
      "valueCode" : "active"
    }, {
      "code" : "internalId",
      "valueCode" : "23536"
    } ],
    "definition" : "7z compression file format. See \\[http://www.7-zip.org/7z.html\\] for more information."
  }, {
    "code" : "ZL",
    "display" : "zlib",
    "property" : [ {
      "code" : "status",
      "valueCode" : "active"
    }, {
      "code" : "internalId",
      "valueCode" : "10623"
    }, {
      "code" : "howApplies",
      "valueString" : "other"
    } ],
    "definition" : "A compressed data format that also uses the deflate algorithm. Specified as RFC 1950 \\[http://www.ietf.org/rfc/rfc1952.txt\\]"
  } ],
  "caseSensitive" : true,
  "version" : "3.0.0",
  "contact" : [ {
    "telecom" : [ {
      "value" : "http://hl7.org",
      "system" : "url"
    }, {
      "value" : "hq@HL7.org",
      "system" : "email"
    } ]
  } ]
}