Berlekamp–Massey algorithm
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.
known for
Wikipage redirect
BCH codeBerlekamp-MasseyBerlekamp-Massey algorithmBlock Wiedemann algorithmElwyn BerlekampEuclidean algorithmHistory of information theoryIndex of cryptography articlesJames MasseyLinear-feedback shift registerList of algebraic coding theory topicsList of algorithmsRank error-correcting codeReeds–Sloane algorithmReed–Solomon error correctionTimeline of information theory
Link from a Wikipage to another Wikipage
known for
primaryTopic
Berlekamp–Massey algorithm
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.
has abstract
The Berlekamp–Massey algorithm ...... he Berlekamp–Massey algorithm.
@en
Алгоритм Берлекэмпа — Мэсси — ...... менения кодов Рида — Соломона.
@ru
伯利坎普-梅西算法(英語:Berlekamp-Massey ...... 该LFSR的线性复杂度。 這一算法由埃爾溫·伯利坎普與發明。
@zh
벌러캠프-매시 알고리즘은 주어진 수열을 만들 수 있는 가장 작은 를 찾는 알고리즘이다. 다시 말해, 선형 점화식의 최소다항식을 구하는 알고리즘이다.
@ko
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,017,637,722
Link from a Wikipage to another Wikipage
id
p/b120140
@en
title
Berlekamp-Massey algorithm
@en
Berlekamp–Massey Algorithm
@en
urlname
Berlekamp-MasseyAlgorithm
@en
wikiPageUsesTemplate
hypernym
comment
The Berlekamp–Massey algorithm ...... an extension to handle a ring.
@en
Алгоритм Берлекэмпа — Мэсси — ...... менения кодов Рида — Соломона.
@ru
伯利坎普-梅西算法(英語:Berlekamp-Massey ...... 该LFSR的线性复杂度。 這一算法由埃爾溫·伯利坎普與發明。
@zh
벌러캠프-매시 알고리즘은 주어진 수열을 만들 수 있는 가장 작은 를 찾는 알고리즘이다. 다시 말해, 선형 점화식의 최소다항식을 구하는 알고리즘이다.
@ko
label
Berlekamp-Massey-Algorithmus
@de
Berlekamp–Massey algorithm
@en
Алгоритм Берлекэмпа — Мэсси
@ru
伯利坎普-梅西算法
@zh
벌러캠프-매시 알고리즘
@ko