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.
Attributes | Values |
---|---|
rdf:type | |
rdfs:label |
|
rdfs:comment |
|
sameAs | |
dbp:wikiPageUsesTemplate | |
Subject | |
gold:hypernym | |
prov:wasDerivedFrom | |
Wikipage page ID |
|
page length (characters) of wiki page |
|
Wikipage revision ID |
|
Link from a Wikipage to another Wikipage | |
has abstract |
|
foaf:isPrimaryTopicOf | |
is Wikipage redirect of | |
is Link from a Wikipage to another Wikipage of | |
is foaf:primaryTopic of |