Superimposed Codes in Rn

IEEE Transactions on Information Theory

Volumn 34, Issue 4, 1988, Pages 877-880

  Ericson, Thomas ^a,b   Gyrf, Laszlo ^a  

^a LINKÖPING INSTITUTE OF TECHNOLOGY   (Sweden)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY--RANDOM PROCESSES;

ASYMPTOTIC EXISTENCE BOUND; EUCLIDEAN N-SPACE; LONG CODES; RANDOM CODING; SUPERIMPOSED CODES;

CODES, SYMBOLIC;

EID: 0024035269     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.9789     Document Type: Article

References (15)

1. W. K. Kautz and R. C. Singleton, "Nonrandom binary superimposed codes," IEEE Trans. Inform. Theory, vol. IT-10, pp. 363-377, Oct. 1964.
2. A. G. Dyachkov and V. V. Rykov, "Bounds on the length of disjunctive codes," Probl. Peredach. Inform., vol. 18, no. 3, pp. 7-13, 1982.
3. "On a coding model for adder multiple-access channel," Probl. Peredach Inform., vol. 17, no. 2, pp. 26-38 (English translation pp. 94-104), 1981.
4. "Survey of superimposed code theory," PCIT, vol. 12, no. 4, pp. 229-244, 1983.
5. L. A. Bassalygo and M. S. Pinsker, "Limited multiple-access of a non-synchronous channel," Probl. Peredach. Inform., vol. 19, no. 4, pp. 92-96, 1983.
6. A. Nguyen Quang, L. Gy#x00F6;rfi, and J. L. Massey, "Some constructions of protocol sequences for collision channel without feedback and a class of optimal cyclic constant weight codes," in Proc. IEEE Int. Symp. Information Theory, June 1985, Brighton, England.
7. "Some constructions of cyclic sets, constant weight codes," un-published.
8. B. Lindstr#x00F6;m, "On a combinatorial detection problem I," Pub. Math. Inst. Hungarian Acad. Sci., vol. 19, pp. 195-207, 1964.
9. "On a combinatorial detection problem II," Studia Sci. Math., Hungary, vol. 1, pp. 353-361, 1965.
10. "A theorem on families of sets," J. Comb. Theory, vol. 13, no. 2, Sept. 1972.
11. "On B 2-sequences of #x00A0; vectors," J. Number Theory, vol. 4, no. 3, pp. 261-265, 1972.
12. P. Frankl and Z. F#x00FC;redi, "Union-free hypergraphs and probability theory," Europ. J. Comb., vol. 5, pp. 127-131, 1984.
13. M. K. Simon, J. K. Omura, R. A. Scholtz, and B. K. Levitt, Spread Spectrum Communications, vol. I, Rockville, MD: Computer Science Press, 1985.
14. J. E. Mazo, "Some theoretical observations on spread spectrum communications," Bell Syst. Tech. J., vol. 58, no. 9, pp. 2013-2023, 1979.
15. R. G. Gallager, Information and Reliable Communication. New York: Wiley, 1968.