Optimal monotone encodings

IEEE Transactions on Information Theory

Volumn 55, Issue 3, 2009, Pages 1343-1353

  Alon, Noga ^a   Hod, Rani ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Monotone encoding; Multiuser tracing; Superimposed codes

Indexed keywords

DATA STRUCTURES;

BROADCAST SCHEMES; COMMUNICATION NETWORKS; ENCODINGS; EXPLICIT CONSTRUCTIONS; LOWER AND UPPER BOUNDS; MONOTONE ENCODING; MULTIUSER TRACING; SUPERIMPOSED CODES; TAMPER PROOFS;

ENCODING (SYMBOLS);

EID: 62749144483     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.2011507     Document Type: Article

References (19)

1. T. Moran, M. Naor, and G. Segev, "Deterministic history-independent strategies for storing information on write-once memories," in Proc. 34th Int. Colloquium on Automata, Languages and Programming (ICALP), Wroclaw, Poland, 2007, pp. 303-315.
2. A. G. Dyachkov and V. V. Rykov, "Bounds on the length of disjunctive codes," Probl. Pered. Inform., vol. 18, no. 3, pp. 158-166, 1982.
3. P. Erdos, P. Frankl, and Z. Füredi, "Families of finite sets in which no set is covered by the union of r others," Israel J. Math., vol. 51, no. 1-2, pp. 79-89, 1985.
4. N. Alon, "Explicit construction of exponential sized families of k independent sets," Discr. Math., vol. 58, no. 2, pp. 191-193, 1986.
5. M. Ruszinkó, "On the upper bound of the size of the r-cover free families," J. Comb. Theory Ser. A, vol. 66, no. 2, pp. 302-310, 1994.
6. Z. Füredi, "A note on r-cover free families," J. Comb. Theory Ser. A, vol. 73, no. 1, pp. 172-173, 1996.
7. M. Csurös and M. Ruszinkó, "Single user tracing and disjointly superimposed codes," IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1606-1611, Apr. 2005.
8. N. Alon and V. Asodi, "Tracing a single user," Europ. J. Comb., vol. 27, no. 8, pp. 1227-1234, 2006.
9. B. Laczay and M. Ruszinkó, "Multiple user tracing codes," in Proc. IEEE Int. Symp. Inf. Theory (ISIT) 2006, Seattle, WA, Jul. 2006, pp. 1900-1904.
10. N. Alon and V. Asodi, "Tracing many users with almost no rate penalty," IEEE Trans. Inf. Theory, vol. 53, no. 1, pp. 437-439, Jan. 2007.
11. A. G. Dyachkov and V. V. Rykov, "A survey of superimposed code theory," Probl. Contr. Inf. Theory, vol. 12, no. 4, pp. 229-242, 1983.
12. J. Komlós and A. Greenberg, "An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels," IEEE Trans. Inf. Theory, vol. IT-31, no. 2, pp. 302-306, Mar. 1985.
13. A. N. Quang and T. Zeisel, "Bounds on constant weight binary super-imposed codes," Probl. Contr. Inf. Theory, vol. 17, no. 4, pp. 223-230, 1988.
14. A. M. Rashad, "Random coding bounds on the rate for list-decoding superimposed codes," Probl. Contr. Inf. Theory, vol. 19, no. 2, pp. 141-149, 1990.
15. D. Coppersmith and J. Shearer, "New bounds for union-free families of sets," Electron. J. Comb., vol. 5, no. 1, #R39, 1998.
16. D. W. Masser, "Note on a conjecture of Szpiro," Astérisque, no. 183, pp. 19-23, 1990.
17. J. Oesterlé, "Nouvelles approches du "théorème" de Fermat," Astérisque, no. 161/162, pp. 165-186, 1988.
18. M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson, "Randomness conductors and constant-degree lossless expanders," in Proc. 34th ACM Symp. Theory of Computing (STOC), Montreal, QC, Canada, May 2002, pp. 659-668.
19. V. Guruswami, C. Umans, and S. Vadhan, "Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes," in Proc. 22nd IEEE Conf. Computational Complexity (CCC), San Diego, CA, Jun. 2007, pp. 96-108.