This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
August 1969 (vol. 18 no. 8)
pp. 763
B. Elspas, Information Science Laboratory Stanford Research Institute
This paper is little more than a rehash of well-known results, mostly from the paper of Bartee and Schneider (Information and Control, vol. 6, pp. 79-98, 1963) and from Elspas (IRE Trans. Circuit Theory, vol. CT-6, pp. 45-60, 1959). The former is not even referenced. Standard algebraic theorems, notably the Cayley-Hamilton theorem, and well-known results on companion matrices are (unnecessarily) demonstrated when a reference to, e. g., Birkhoff-Mac-Lane would have sufficed. Fig. 2 of this paper is identical to a figure on page 117 of W. W. Peterson, Error Correcting Codes (Cambridge, Mass.: M.I.T. Press, and New York: Wiley, 1961). One wonders why this paper was written at all, and what kind of review procedure it did (or did not) receive.
Citation:
B. Elspas, "R69-22 Computation over Galois Fields Using Shiftregisters," IEEE Transactions on Computers, vol. 18, no. 8, pp. 763, Aug. 1969, doi:10.1109/T-C.1969.222766
Usage of this product signifies your acceptance of the Terms of Use.