Name
Abstract | ||
|---|---|---|
It is shown that the generalized Berlekamp-Massey algorithm (GBMA, in short) for solving the linear synthesis problem of a multi-sequence r over F2 can be obtained naturally from a special form of the multi-continued fraction algorithm, called the multi-strict continued fraction algorithm (m-SCFA, in short). Moreover, the discrepancy sequence in acting GBMA on r is expressed explicitly by the data associated to the multi-strict continued fraction expansion C( r) which is obtained by applying m-SCFA on r. As a consequence, a 1-1 correspondence between multi-sequences of any given length and certain multi-strict continued fractions is established. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.ffa.2005.06.008 | Finite Fields and their Applications |
Keywords | Field | DocType |
linear synthesis problem,discrepancy sequence,multi-sequence r,multi-strict continued fraction expansion,certain multi-strict,multi-continued fraction algorithm,generalized b-m algorithm,multi-strict continued fraction algorithm,generalized berlekamp-massey algorithm,special form,iterative algorithm,finite field,minimal polynomial,continued fraction,continued fraction expansion | Discrete mathematics,Combinatorics,Finite field,Continued fraction,Algebra,Polynomial,Iterative method,Berlekamp's algorithm,Algorithm,Berlekamp–Massey algorithm,Mathematics,Computation | Conference |
Volume | Issue | ISSN |
12 | 3 | 10902465 |
ISBN | Citations | PageRank |
3-540-26084-6 | 12 | 0.85 |
References | Authors | |
7 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zong-duo Dai | 1 | 203 | 25.53 |
| Xiutao Feng | 2 | 61 | 9.93 |
| Jun-Hui Yang | 3 | 47 | 4.28 |
| ZD Dai | 4 | 12 | 0.85 |
| XT Feng | 5 | 12 | 0.85 |
| JH Yang | 6 | 40 | 2.95 |