Triple
T1451895
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Elwyn R. Berlekamp |
E31309
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Berlekamp–Massey algorithm
The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
|
E167281
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a499171a28819085b993a3ac78e363 |
elicitation | completed |
| NER | batch_69a4c57d34cc8190801b769d9d9b2e2e |
ner | completed |
| NED1 | batch_69ad0e71ffd481909dfd0f77201dc17c |
ned_source_triple | completed |
| NED2 | batch_69ad0fbdd20081909ea89e527a4e342e |
ned_description | completed |
| NEDg | batch_69ad0f6838bc8190b0a77eda44f1949e |
nedg | completed |
Created at: March 1, 2026, 8 p.m.