Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("ALGORITHME BERLEKAMP")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 24 of 24

  • Page / 1

Export

Selection :

  • and

CONTINUED FRACTIONS AND BERLEKAMP'S ALGORITHMWELCH LR; SCHOLTZ RA.1979; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1979; VOL. 25; NO 1; PP. 19-27; BIBL. 16 REF.Article

SOME RESULTS IN DECODING OF CERTAIN MAXIMAL DISTANCE AND BCH CODESMANDELBAUM D.1972; INFORM. AND CONTROL; U.S.A.; DA. 1972; VOL. 20; NO 3; PP. 232-243; BIBL. 15 REF.Serial Issue

On the continued fraction and Berlekamp's algorithmUNJENG CHENG.IEEE transactions on information theory. 1984, Vol 30, Num 3, pp 541-544, issn 0018-9448Article

Algorithmes de factorisation de polynômes = Algorithms for factoring polynomialsLUGIEZ, Denis.1984, Pagination multThesis

On the equivalence between Berlekamp's and Euclid's algorithmsDORNSTETTER, J. L.IEEE transactions on information theory. 1987, Vol 33, Num 3, pp 428-431, issn 0018-9448Article

Shift-register synthesis (modulo m)REEDS, J. A; SLOANE, N. J. A.SIAM journal on computing (Print). 1985, Vol 14, Num 3, pp 505-513, issn 0097-5397Article

Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over FqFLEISCHMANN, P.Linear algebra and its applications. 1993, Vol 192, pp 101-108, issn 0024-3795Conference Paper

On constructing a shortest linear recurrence relationKUIJPER, M; WILLEMS, J. C.IEEE transactions on automatic control. 1997, Vol 42, Num 11, pp 1554-1558, issn 0018-9286Article

On the methods for solving Yule-Walker equationsHUI-MIN ZHANG; DUHAMEL, P.IEEE Transactions on signal processing. 1992, Vol 40, Num 12, pp 2987-3000Article

A simple derivation of the Berlekamp-Massey algorithm and some applicationsIMAMURA, K; YOSHIDA, W.IEEE transactions on information theory. 1987, Vol 33, Num 1, pp 146-150, issn 0018-9448Conference Paper

On linear complexity of sequences over GF(2n)YOUSSEF, A. M; GONG, G.Theoretical computer science. 2006, Vol 352, Num 1-3, pp 288-292, issn 0304-3975, 5 p.Article

Generalised Berlekamp-Massey algorithmCHENG, M.-H.IEE proceedings. Communications. 2002, Vol 149, Num 4, pp 207-210, issn 1350-2425Article

Tuning and generalizing Van Hoeij's algorithm = Implantation efficace et généralisation de l'algorithme de van HoeijBelabas, Karim; Hanrot, Guillaume; Zimmermann, Paul et al.Rapports de recherche - INRIA. 2001, issn 0249-6399 isrn=INRIA/RR-4124-FR+ENG, 13 p.Report

An algorithm for computing a shortest linear recurrence relation for a sequence of matrices : generalizing the Berlekamp-Massey algorithmKUIJPER, M; WILLEMS, J. C.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 441Conference Paper

An algorithm for t+1 error correction in reed- solomon codesEGOROV, S. I; MARKARIAN, G.IEEE International Conference on Communications. 2004, isbn 0-7803-8533-0, vol2, 651-655Conference Paper

An algorithm for shifted continued fraction expansions in parallel linear timeNIEDERREITER, H; VIELHABER, M.Theoretical computer science. 1999, Vol 226, Num 1-2, pp 93-104, issn 0304-3975Article

Fast decoding of codes from algebraic plane curvesJUSTESEN, J; LARSEN, K. J; JENSEN, H. E et al.IEEE transactions on information theory. 1992, Vol 38, Num 1, pp 111-119, issn 0018-9448Article

Résolution d'équations de degré modulo de grands nombres premiers = Solving equations of small degree modulo large primesMORAIN, François.Rapports de recherche - INRIA. 1989, Vol 1085, issn 0249-6399, 13 p.Report

On semigroups generated by two consecutive integers and improved hermitian codesBRAS-AMOROS, Maria; O'SULLIVAN, Michael E.IEEE transactions on information theory. 2007, Vol 53, Num 7, pp 2560-2566, issn 0018-9448, 7 p.Article

Reducing the computation of linear complexities of periodic sequences over GF(pm)HAO CHEN.IEEE transactions on information theory. 2006, Vol 52, Num 12, pp 5537-5539, issn 0018-9448, 3 p.Article

A type of recurring relations on sequences and efficient decoding of a class of algebraic-geometric codesBAO LI; XIAO, G.-Z.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 94Conference Paper

A view of gaussian elimination applied to early-stopped berlekamp-massey algorithmLIU, Chih-Wei; LU, Chung-Chin.IEEE transactions on communications. 2007, Vol 55, Num 6, pp 1131-1143, issn 0090-6778, 13 p.Article

Fast transform for decoding both errors and erasures of reed-solomon codes over GF(2m) for 8 ≤ m ≤ 10TRUONG, T. K; CHEN, P. D; WANG, L. J et al.IEEE transactions on communications. 2006, Vol 54, Num 2, pp 181-186, issn 0090-6778, 6 p.Article

Systolic array architecture implementing berlekamp-massey-sakata algorithm for decoding codes on a class of algebraic curvesMATSUI, Hajime; SAKATA, Shojiro; KURIHARA, Masazumi et al.IEEE transactions on information theory. 2005, Vol 51, Num 11, pp 3856-3871, issn 0018-9448, 16 p.Article

  • Page / 1