VLSI Designs for Multiplication over Finite Fields GF (2m)
暂无分享,去创建一个
[1] Neil Weste,et al. Principles of CMOS VLSI Design , 1985 .
[2] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[3] Herbert O. Burton. Inversionless decoding of binary BCH codes , 1971, IEEE Trans. Inf. Theory.
[4] Kuang Yung Liu. Architecture for VLSI Design of Reed-Solomon Decoders , 1984, IEEE Trans. Computers.
[5] Rudolf Lide,et al. Finite fields , 1983 .
[6] L. Dickson. Linear Groups, with an Exposition of the Galois Field Theory , 1958 .
[7] Thomas C. Bartee,et al. Computation with Finite Fields , 1963, Inf. Control..
[8] Trieu-Kien Truong,et al. Systolic Multipliers for Finite Fields GF(2m) , 1984, IEEE Transactions on Computers.
[9] Trieu-Kien Truong,et al. VLSI Architectures for Computing Multiplications and Inverses in GF(2m) , 1983, IEEE Transactions on Computers.
[10] Jacobus H. van Lint,et al. Introduction to Coding Theory , 1982 .
[11] Neal Zierler,et al. On Primitive Trinomials (Mod 2) , 1968, Inf. Control..
[12] W. W. Peterson,et al. Error-Correcting Codes. , 1962 .
[13] J.L. Massey,et al. Theory and practice of error control codes , 1986, Proceedings of the IEEE.
[14] 小島 辰一. Linear Sequential Circuits , 1981 .
[15] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[16] Craig K. Rushforth,et al. A Cellular-Array Multiplier for GF(2m) , 1971, IEEE Transactions on Computers.
[17] Richard E. Blahut,et al. A Universal Reed-Solomon Decoder , 1984, IBM J. Res. Dev..