This HTML5 document contains 43 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/
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/
n5http://neilsloane.com/doc/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n8http://mathworld.wolfram.com/
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Reeds–Sloane_algorithm
rdf:type
yago:YagoPermanentlyLocatedEntity yago:Abstraction100002137 yago:Algorithm105847438 yago:Event100029378 yago:Act100030358 yago:PsychologicalFeature100023100 yago:Activity100407535 yago:Procedure101023820 yago:Rule105846932 dbo:Software yago:WikicatCryptanalyticAlgorithms
rdfs:label
Reeds–Sloane algorithm
rdfs:comment
The Reeds–Sloane algorithm, named after and Neil Sloane, is an extension of the Berlekamp–Massey algorithm, an algorithm for finding the shortest linear-feedback shift register (LFSR) for a given output sequence, for use on sequences that take their values from the integers mod n.
dcterms:subject
dbc:Cryptanalytic_algorithms
dbo:wikiPageID
1062262
dbo:wikiPageRevisionID
1056438748
dbo:wikiPageWikiLink
dbr:Neil_Sloane dbr:Integers_mod_n dbr:MathWorld dbr:Sequence dbr:James_Reeds dbr:Linear-feedback_shift_register dbr:Berlekamp–Massey_algorithm dbc:Cryptanalytic_algorithms
dbo:wikiPageExternalLink
n5:Me111.pdf n8:Reeds-SloaneAlgorithm.html
owl:sameAs
n11:4tpw4 freebase:m.042pl7 wikidata:Q7306757
dbp:wikiPageUsesTemplate
dbt:Cite_journal dbt:Crypto-stub
dbo:abstract
The Reeds–Sloane algorithm, named after and Neil Sloane, is an extension of the Berlekamp–Massey algorithm, an algorithm for finding the shortest linear-feedback shift register (LFSR) for a given output sequence, for use on sequences that take their values from the integers mod n.
gold:hypernym
dbr:Extension
prov:wasDerivedFrom
wikipedia-en:Reeds–Sloane_algorithm?oldid=1056438748&ns=0
dbo:wikiPageLength
926
foaf:isPrimaryTopicOf
wikipedia-en:Reeds–Sloane_algorithm
Subject Item
dbr:Reeds-Sloane_algorithm
dbo:wikiPageWikiLink
dbr:Reeds–Sloane_algorithm
dbo:wikiPageRedirects
dbr:Reeds–Sloane_algorithm
Subject Item
dbr:Berlekamp–Massey_algorithm
dbo:wikiPageWikiLink
dbr:Reeds–Sloane_algorithm
Subject Item
dbr:Neil_Sloane
dbo:wikiPageWikiLink
dbr:Reeds–Sloane_algorithm
Subject Item
dbr:Reed-Sloane_algorithm
dbo:wikiPageWikiLink
dbr:Reeds–Sloane_algorithm
dbo:wikiPageRedirects
dbr:Reeds–Sloane_algorithm
Subject Item
wikipedia-en:Reeds–Sloane_algorithm
foaf:primaryTopic
dbr:Reeds–Sloane_algorithm