Berlekamp–Massey algorithm

Known as: Berlekamp-Massey, 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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1955-2018
0102019552017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Designing of a reliable digital system is a challenging task because it incorporates testing of circuits at the design time. With… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 4
Is this relevant?
2013
2013
We analyze the Matrix Berlekamp/Massey algorithm, which generalizes the Berlekamp/Massey algorithm [Massey 1969] for computing… (More)
  • table I
  • table II
Is this relevant?
2010
2010
We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain D. This theorem is… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2007
2007
In this paper, an algebraic decoding method is proposed for the quadratic residue codes that utilize the Berlekamp-Massey… (More)
  • table 1
  • figure 1
Is this relevant?
2006
2006
We analyze the Matrix Berlekamp/Massey algorithm, which generalizes the Berlekamp/Massey algorithm [Massey 1969] for computing… (More)
  • table I
  • table II
Is this relevant?
2005
2005
We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly… (More)
Is this relevant?
2004
2004
The BerlekampMassey algorithm is revisited and proven again by using the matrix representation. This approach makes the… (More)
  • figure 1
  • table 1
Is this relevant?
2004
2004
Reed-Solomon (RS) codes are error-correcting codes used in many of today's communication systems. RS encoding and decoding are… (More)
  • table 1
Is this relevant?
2004
2004
Universal Reed-Solomon decoders allow flexibility in some or all of the code parameters,and hence lend themselves to applications… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
We propose a new efficient serial architecture to implement the Berlekamp–Massey algorithm, which is frequently used in BCH and… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
Is this relevant?