On Optimum Time-Hopping Patterns

IEEE Transactions on Communications

Volumn 36, Issue 3, 1988, Pages 380-382

  Sarwate, Dilip V ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TRANSMISSION - PACKET SWITCHING;

BOSE SIMPLE DIFFERENCE SETS (BDS); SINGER SIMPLE DIFFERENCE SETS (SDS); TIME-HOPPING MULTIPLE ACCESS; TIME-HOPPING PATTERNS;

DIGITAL COMMUNICATION SYSTEMS;

EID: 0023981744     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.1464     Document Type: Article

References (16)

1. M. D. Atkinson, N. Santoro, and J. Urrutia, “Integer sets with distinct sums and differences and carrier frequency assignments for nonlinaer repeaters,’’ IEEE Trans. Commun., vol. COM-34, pp. 614-617, June 1986.
2. L. D. Baumert, “Cyclic difference sets,” in Lectures Notes and Mathematics. Germany: Springer-Verlag.
3. R. C. Bose, “An affine analogue of Singer’s theorem,” J. Indust. Math. Soc., vol. 6. pp. 1-15, 1942.
4. A. K. Dewdney, “Computer recreations,” Scientif. Amer., vol. 254, no. 3, pp. 1986.
5. P. Erdos and P. Turan, “On a problem of Sidon in additive number theory, and on some related problems,” J. London Math. Soc., vol. 26, pp. 212-215, 1941. Addendum, vol. 19, pp. 242, 1944.
6. R. K. Guy, Unsolved problems in Intuitive Mathematics: Unsolved Problems in Number Theory, Vol. I. New York: Springer-Verlag, 1981, pp. 65-68.
7. D. R. Heath-Brown and H. Iwaniec, “On the difference between consecutive primes,” Invent. Math., vol. 55, no. 1, 49-69, 1979.
8. A. W. Lam and D. V. Sarwate, “Throughput of time-hopping and frequency-hopping communications in slotted ALOHA,” in Proc. Nineteenth Annu. Conf. Informat. Sci. Sys., Johns Hopkins Univ., Baltimore, MD, Mar. 1985, pp. 538-542.
9. —,'’ Optimum time-hopping patterns,” in Proc. Twentieth Annu. Conf. Inform. Sci. Syst., Princeton Univ. Princeton, NJ, Mar. 1985, pp. 81-86.
10. B. Lindstrom, “An inequality for B 2 -sequences,” J. Comb. Theory, vol. 6, 211-212, 1969.
11. A. Main and S. Chowla, “On the B 2 -sequences of Sidon,” Proc. Nat. Acad. Sci. India, sect. A, vol. 14, pp. 3-4, 1944.
12. P. D. Rasky and D. V. Sarwate, “Performance analysis of a time-hopping multiple-access communication scheme,” in Proc. Eighteenth Annu. Conf. Inform. Sci. Syst., Princeton Univ. Princeton, NJ, Mar. 1984, pp. 131-132.
13. J. P. Robinson and A. J. Bernstein, “A class of binary recurrent codes with limited error propagation,” IEEE Trans. Inform. Theory, vol. IT-13, no. 1, pp. 106-113, 1967.
14. J. P. Robinson, “Optimum Golomb rulers,” IEEE Trans. Comput., vol. C-28, pp. 943-944, Dec. 1979.
15. J. Singer, “A theorem in finite projective geometry and some applications to number theory,” Trans. Amer. Math. Soc., vol. 43, 377-385, 1938.
16. H. Taylor and S. W. Golomb, “Rulers-Part 1,” Commun. Sci. Inst., Univ. Sourthern California, Los Angeles, CA, Tech. Rep., 85-05-01, May 1985.