Modified Berlekamp-Massey algorithm for approximating the k-error linear complexity of binary sequences by Alexandra Alecu, Ana Salagean

“…We show that the Berlekamp-Massey Algorithm, which computes the linear complexity of a sequence, can be adapted to approximate the k-error linear complexity profile for a general sequence over a finite field. …”
Get full text

An algorithm for computing minimal bidirectional linear recurrence relations by Ana Salagean

“…Such a recurrence relation can then be used to generate the sequence in both directions (increasing or decreasing order of indices), so we call it bidirectional. …”
Get full text

Linking comprehensive performance assessment to the balanced scorecard by Margaret Woods, Suzana Grubnic

“…After demonstrating the parallels between the CPA framework and Kaplan and Norton's public sector Balanced Scorecard (BSC), we use a case study of the BSC based performance management system in Hertfordshire County Council to demonstrate the empirical linkages between a local scorecard and CPA. …”
Get full text

The human muscle size and strength relationship: effects of architecture, muscle force, and measurement location by Tom Balshaw, Tom Maden-Wilkinson, Garry J Massey, Jonathan Folland

Get full text

On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two by Ana Salagean

“…The linear Games-Chan algorithm for computing the linear complexity c(s) of a binary sequence s of period ℓ = 2n requires the knowledge of the full sequence, while the quadratic Berlekamp-Massey algorithm only requires knowledge of 2c(s) terms. …”
Get full text