This HTML5 document contains 50 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n11https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:List_of_algebraic_coding_theory_topics
dbo:wikiPageWikiLink
dbr:Luhn_mod_N_algorithm
Subject Item
dbr:List_of_algorithms
dbo:wikiPageWikiLink
dbr:Luhn_mod_N_algorithm
Subject Item
dbr:Advanced_Audio_Coding
dbo:wikiPageWikiLink
dbr:Luhn_mod_N_algorithm
Subject Item
dbr:Luhn_algorithm
dbo:wikiPageWikiLink
dbr:Luhn_mod_N_algorithm
Subject Item
dbr:Luhn_mod_N_algorithm
rdf:type
dbo:Software yago:Event100029378 yago:Rule105846932 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Procedure101023820 yago:Algorithm105847438 yago:Abstraction100002137 yago:WikicatChecksumAlgorithms yago:Act100030358 yago:Activity100407535
rdfs:label
Luhn mod N algorithm
rdfs:comment
The Luhn mod N algorithm is an extension to the Luhn algorithm (also known as mod 10 algorithm) that allows it to work with sequences of values in any even-numbered base. This can be useful when a check digit is required to validate an identification string composed of letters, a combination of letters and digits or any arbitrary set of N characters where N is divisible by 2.
dcterms:subject
dbc:Modular_arithmetic dbc:Checksum_algorithms dbc:Articles_with_example_code dbc:Articles_with_example_C_Sharp_code
dbo:wikiPageID
6870554
dbo:wikiPageRevisionID
1117219145
dbo:wikiPageWikiLink
dbc:Checksum_algorithms dbr:Decimal dbr:International_Securities_Identification_Number dbr:Luhn_algorithm dbc:Articles_with_example_C_Sharp_code dbc:Articles_with_example_code dbr:Radix dbr:Associative_array dbr:English_alphabet dbc:Modular_arithmetic
owl:sameAs
n11:4qmJG yago-res:Luhn_mod_N_algorithm wikidata:Q6699881 freebase:m.0gtjtr
dbp:wikiPageUsesTemplate
dbt:Var dbt:Not_a_typo dbt:Unreferenced
dbo:abstract
The Luhn mod N algorithm is an extension to the Luhn algorithm (also known as mod 10 algorithm) that allows it to work with sequences of values in any even-numbered base. This can be useful when a check digit is required to validate an identification string composed of letters, a combination of letters and digits or any arbitrary set of N characters where N is divisible by 2.
gold:hypernym
dbr:Extension
prov:wasDerivedFrom
wikipedia-en:Luhn_mod_N_algorithm?oldid=1117219145&ns=0
dbo:wikiPageLength
14773
foaf:isPrimaryTopicOf
wikipedia-en:Luhn_mod_N_algorithm
Subject Item
dbr:Luhn_mod_N_Algorithm
dbo:wikiPageWikiLink
dbr:Luhn_mod_N_algorithm
dbo:wikiPageRedirects
dbr:Luhn_mod_N_algorithm
Subject Item
dbr:Luhn_mod_n_algorithm
dbo:wikiPageWikiLink
dbr:Luhn_mod_N_algorithm
dbo:wikiPageRedirects
dbr:Luhn_mod_N_algorithm
Subject Item
wikipedia-en:Luhn_mod_N_algorithm
foaf:primaryTopic
dbr:Luhn_mod_N_algorithm