메뉴 건너뛰기
Mathematics of Computation
Volumn 67, Issue 224, 1998, Pages 1665-1678
Euclid's algorithm and the Lanczos method over finite fields
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0032372015     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/s0025-5718-98-00973-9     Document Type: Article
Times cited : (9)
References (7)
  • 1
    • 0040817928 scopus 로고
    • Recursive algorithms for non-normal Pade tables
    • MR 82e:65018
    • A. Bultheel, Recursive algorithms for non-normal Pade tables, SIAM Journal on Applied Mathematics, 39, (1980), 1:106-118. MR 82e:65018
    • (1980) SIAM Journal on Applied Mathematics , vol.39 , Issue.1 , pp. 106-118
    • Bultheel, A.1
  • 2
    • 21144460202 scopus 로고
    • Solving linear equations over GF(2); block Lanczos algorithm
    • MR 94i:65044
    • D. Coppersmith, Solving linear equations over GF(2); block Lanczos algorithm.. Linear Algebra and its Applications 192 (1993), 33-60. MR 94i:65044
    • (1993) Linear Algebra and its Applications , vol.192 , pp. 33-60
    • Coppersmith, D.1
  • 3
    • 84968521645 scopus 로고
    • Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm
    • MR 94c:11124
    • D. Coppersmith, Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm, Mathematics of Computation 62 (1994), 205:333-350. MR 94c:11124
    • (1994) Mathematics of Computation , vol.62 , Issue.205 , pp. 333-350
    • Coppersmith, D.1
  • 4
    • 0023346708 scopus 로고
    • On the equivalence between Berlekamp's and Euclid's algorithms
    • MR 88j:94018
    • J. L. Dornstetter, On the equivalence between Berlekamp's and Euclid's algorithms, IEEE Transactions on Information Theory 33 (1987), 3:428-431. MR 88j:94018
    • (1987) IEEE Transactions on Information Theory , vol.33 , Issue.3 , pp. 428-431
    • Dornstetter, J.L.1
  • 5
    • 84968492714 scopus 로고
    • Analysis of Coppersmith's block Wiedemann algorithm, for the parallel solution of sparse linear systems
    • MR 95f:65094
    • E. Kaltofen, Analysis of Coppersmith's block Wiedemann algorithm, for the parallel solution of sparse linear systems. Mathematics of Computation 64 (1995), 210:777-806. MR 95f:65094
    • (1995) Mathematics of Computation , vol.64 , Issue.210 , pp. 777-806
    • Kaltofen, E.1
  • 6
    • 84957682846 scopus 로고
    • A block Lanczos algorithm for finding dependencies over GF(2)
    • Advances in cryptology - EUROCRYPT '95 (Saint-Malo, 1995), Springer, Berlin. MR 97c:11115
    • P. Montgomery, A block Lanczos algorithm for finding dependencies over GF(2), Advances in cryptology - EUROCRYPT '95 (Saint-Malo, 1995), Lecture Notes in Computer Science 921, Springer, Berlin, 1995. MR 97c:11115
    • (1995) Lecture Notes in Computer Science , vol.921
    • Montgomery, P.1
  • 7
    • 0022583143 scopus 로고
    • Solving sparse linear equations over finite fields
    • MR 87g:11166
    • D.H. Wiedemann, Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory 32 (1988), 1:54 62. MR 87g:11166
    • (1988) IEEE Transactions on Information Theory , vol.32 , Issue.1 , pp. 5462
    • Wiedemann, D.H.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.