This Article 
 Bibliographic References 
 Add to: 
On Subsequences of Arithmetic Sequences
October 1988 (vol. 37 no. 10)
pp. 1314-1315
A property of subsequences in arithmetic or decimal sequences is proved. This property has a somewhat similar counterpart for linear-feedback shift register (LFSR) sequences discovered by J.L. Massey (1969). However, it is proved in a different manner, and the limit bound is two units away from the corresponding LFSR property. This property holds for any radix, but the conditions depend somewha

[1] D. Mandelbaum, "A comparison of linear sequential circuits and arithmetic sequences,"IEEE Trans. Electron. Comput., vol. EC-16, pp. 151-157, Apr. 1967.
[2] D. Mandelbaum, "Arithmetic codes with large distance,"IEEE Trans. Inform. Theory, vol. IT-13, pp. 237-242, 1967.
[3] S. C. Kak and A. Chatterjee, "On decimal sequences,"IEEE Trans. Inform. Theory, vol. IT-27, Sept. 1981.
[4] S. C. Kak, "Encryption and error-correction coding usingDsequences,"IEEE Trans. Comput., vol. C-34, pp. 803-809, Sept. 1985.
[5] T. R. N. Rao,Error Coding for Arithmetic Processors. New York: Academic, 1974.
[6] J.L. Massey, "Shift-Register Synthesis and BCH Decoding,"IEEE Trans. Information Theory, Vol. IT-15, No. 1, Jan. 1969, pp. 122-127.

Index Terms:
subsequences; arithmetic sequences; linear-feedback shift register; binary sequences; codes.
D.M. Mandelbaum, "On Subsequences of Arithmetic Sequences," IEEE Transactions on Computers, vol. 37, no. 10, pp. 1314-1315, Oct. 1988, doi:10.1109/12.5997
Usage of this product signifies your acceptance of the Terms of Use.