About: Berlekamp–Massey algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Berlekamp–Massey algorithm Goto Sponge Distinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

The Berlekamp–Massey algorithm is an algorithm that will find the shortest linear-feedback shift register (LFSR) for a given binary output sequence. The algorithm will also find the minimal polynomial of a linearly recurrent sequence in an arbitrary field. The field requirement means that the Berlekamp–Massey algorithm requires all non-zero elements to have a multiplicative inverse. Reeds and Sloane offer an extension to handle a ring.

Attributes	Values
rdf:type	Thing software
rdfs:label	Berlekamp–Massey algorithm (en)
rdfs:comment	The Berlekamp–Massey algorithm is an algorithm that will find the shortest linear-feedback shift register (LFSR) for a given binary output sequence. The algorithm will also find the minimal polynomial of a linearly recurrent sequence in an arbitrary field. The field requirement means that the Berlekamp–Massey algorithm requires all non-zero elements to have a multiplicative inverse. Reeds and Sloane offer an extension to handle a ring. (en)
differentFrom	Berlekamp's algorithm
sameAs	Berlekamp–Massey algorithm
dbp:wikiPageUsesTemplate	dbt:Distinguish dbt:Harvtxt dbt:In_lang dbt:MathWorld dbt:Reflist dbt:Springer
Subject	Cryptanalytic algorithms Articles with example code Error detection and correction
Link from a Wikipage to an external page	http://www.informationsuebertragung.ch/indexAlgorithmen.html https://berlekamp-massey-algorithm.appspot.com/ https://code.google.com/p/lfsr/ https://web.archive.org/web/20120716181541/http:/planetmath.org/encyclopedia/BerlekampMasseyAlgorithm.html
gold:hypernym	Algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Berlekamp–Massey_algorithm?oldid=1056438545&ns=0
Wikipage page ID	514832 (xsd:integer)
page length (characters) of wiki page	8400 (xsd:nonNegativeInteger)
Wikipage revision ID	1056438545 (xsd:integer)
Link from a Wikipage to another Wikipage	Nonlinear-feedback shift register Cryptanalytic algorithms Algorithm BCH code Articles with example code Error detection and correction James Massey Decoding methods Linear-feedback shift register PlanetMath Minimal polynomial (field theory) Elwyn Berlekamp Field (mathematics) Recurrence relation Reeds–Sloane algorithm Reed–Solomon error correction Ring (mathematics)
has abstract	The Berlekamp–Massey algorithm is an algorithm that will find the shortest linear-feedback shift register (LFSR) for a given binary output sequence. The algorithm will also find the minimal polynomial of a linearly recurrent sequence in an arbitrary field. The field requirement means that the Berlekamp–Massey algorithm requires all non-zero elements to have a multiplicative inverse. Reeds and Sloane offer an extension to handle a ring. Elwyn Berlekamp invented an algorithm for decoding Bose–Chaudhuri–Hocquenghem (BCH) codes. James Massey recognized its application to linear feedback shift registers and simplified the algorithm. Massey termed the algorithm the LFSR Synthesis Algorithm (Berlekamp Iterative Algorithm), but it is now known as the Berlekamp–Massey algorithm. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Berlekamp–Massey_algorithm
is Wikipage redirect of	Berlekamp-Massey algorithm Berlekamp-Massey
is Link from a Wikipage to another Wikipage of	BCH code Berlekamp-Massey algorithm Block Wiedemann algorithm James Massey History of information theory Linear-feedback shift register List of algebraic coding theory topics List of algorithms Elwyn Berlekamp Index of cryptography articles Berlekamp-Massey Euclidean algorithm
is known for of	Elwyn Berlekamp
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Berlekamp–Massey_algorithm

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software