This page is part of the HL7 Terminology (v5.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 
: IntegrityCheckAlgorithm - JSON Representation
Raw json | Download
{
"resourceType" : "CodeSystem",
"id" : "v3-IntegrityCheckAlgorithm",
"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>Type</b></td><td><b>Description</b></td></tr><tr><td>Specializes</td><td/><td>Coding</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></tr><tr><td>Generalizes</td><td/><td>Coding</td><td>Inverse of Specializes. Only included as a derived relationship.</td></tr><tr><td>internalId</td><td>http://terminology.hl7.org/CodeSystem/utg-concept-properties#v3-internal-id</td><td>code</td><td>The internal identifier for the concept in the HL7 Access database repository.</td></tr><tr><td>status</td><td>http://hl7.org/fhir/concept-properties#status</td><td>code</td><td>Designation of a concept's state. Normally is not populated unless the state is retired.</td></tr></table><p>This code system <code>http://terminology.hl7.org/CodeSystem/v3-IntegrityCheckAlgorithm</code> 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>status</b></td></tr><tr><td style=\"white-space:nowrap\">SHA-1<a name=\"v3-IntegrityCheckAlgorithm-SHA-1\"> </a></td><td>secure hash algorithm - 1</td><td>This algorithm is defined in FIPS PUB 180-1: Secure Hash Standard. As of April 17, 1995.</td><td>17386</td><td>active</td></tr><tr><td style=\"white-space:nowrap\">SHA-256<a name=\"v3-IntegrityCheckAlgorithm-SHA-256\"> </a></td><td>secure hash algorithm - 256</td><td>This algorithm is defined in FIPS PUB 180-2: Secure Hash Standard.</td><td>17387</td><td>active</td></tr></table></div>"
},
"url" : "http://terminology.hl7.org/CodeSystem/v3-IntegrityCheckAlgorithm",
"identifier" : [
{
"system" : "urn:ietf:rfc:3986",
"value" : "urn:oid:2.16.840.1.113883.5.1010"
}
],
"version" : "2.1.0",
"name" : "IntegrityCheckAlgorithm",
"title" : "IntegrityCheckAlgorithm",
"status" : "active",
"experimental" : false,
"date" : "2019-03-20",
"publisher" : "Health Level 7",
"contact" : [
{
"name" : "Health Level Seven"
}
],
"description" : "**** MISSING DESCRIPTION ****",
"caseSensitive" : true,
"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" : "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" : "SHA-1",
"display" : "secure hash algorithm - 1",
"definition" : "This algorithm is defined in FIPS PUB 180-1: Secure Hash Standard. As of April 17, 1995.",
"property" : [
{
"code" : "status",
"valueCode" : "active"
},
{
"code" : "internalId",
"valueCode" : "17386"
}
]
},
{
"code" : "SHA-256",
"display" : "secure hash algorithm - 256",
"definition" : "This algorithm is defined in FIPS PUB 180-2: Secure Hash Standard.",
"property" : [
{
"code" : "status",
"valueCode" : "active"
},
{
"code" : "internalId",
"valueCode" : "17387"
}
]
}
]
}
|
Propose a change