{"id":18,"date":"2012-05-08T15:42:52","date_gmt":"2012-05-08T12:42:52","guid":{"rendered":"http:\/\/www.eng.biu.ac.il\/brosss\/?page_id=18"},"modified":"2012-05-08T15:50:19","modified_gmt":"2012-05-08T12:50:19","slug":"conference-paper","status":"publish","type":"page","link":"https:\/\/www.eng.biu.ac.il\/brosss\/conference-paper\/","title":{"rendered":"Conference papers"},"content":{"rendered":"
    \n
  1. S. Bross, \u201cError Probability Upper Bound for Two-User Trellis Codes on Multiple-Access Channels\u201d, CISS 1991, Baltimore.<\/li>\n
  2. S. Bross and Ian F. Blake, \u201cTrellis Codes for the Binary and N-User Adder Channel,\u201d CISS 1992, Princeton.<\/li>\n
  3. S. I. Bross and I. F. Blake, \u201cUpper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel,\u201d ISIT 1993, San Antonio. <\/li>\n
  4. Anand Oka, S. Bross and Shlomo Shamai, \u201cTwo Approaches to High Gain Multilevel QAM Coding,\u201d ISIT 1998, MIT Boston.<\/li>\n
  5. Tamar Danon and S. Bross, \u201cFree distance lower bounds for unequal error-protection convolutional codes,\u201d ISIT 2000, Sorrento.<\/li>\n
  6. S. Bross, Marat Burnashev and Shlomo Shamai, \u201cError exponents for the two-user Poisson multiple-access channel,\u201d ISIT 2000, Sorrento. <\/li>\n
  7. S. Bross and Shlomo Shamai, \u201cCapacity and decoding rules for the Poisson arbitrarily varying channel,\u201d ISIT 2001, Washington DC. <\/li>\n
  8. Sokolovsky and S. Bross, \u201cAttainable error exponents for the Poissson broadcast channel with degraded message sets,\u201d ISIT 2002, Lausanne.<\/li>\n
  9. S. Bross and A. Lapidoth, \u201cCode constructions for the ideal two-user Poissson multiple-access channel with noiseless feedback,\u201d ISIT 2002, Lausanne.<\/li>\n
  10. A. Dabbagh and S. Bross, \u201cSequential signaling under peak-power constraint in the Poisson regime,\u201d Presented at the IEEE 2002 convention December 2002, Tel-Aviv, Israel. <\/li>\n
  11. S. Bross and A. Lapidoth, \u201cAn improved achievable region for the discrete memoryless two-user multiple-access channel with noiseless feedback,\u201d ISIT 2003, Yokohama. <\/li>\n
  12. G. Nakibly and S. Bross, \u201cOn the reliability exponent of the geometric-server timing channel,\u201d ISIT 2004, Chicago IL. <\/li>\n
  13. Y. Ovadia and S. Bross, \u201cOn the reliability exponent of the exponential telephone signaling channel,\u201d Presented at the ETH-Technion meeting Feb. 16-17 2004, and IEEE Israel convention 2004. <\/li>\n
  14. S. Ronen, S. Bross, S. Shamai (Shitz) and T. M. Duman, \u201cIterative channel estimation and decoding in turbo coded space time systems,\u201d IEEE Israel convention 2004.<\/li>\n
  15. Y. Gabbai and S. Bross, \u201cAchievable rates for partial feedback configurations of the discrete memoryless relay channel,\u201d CISS 2005, Baltimore. <\/li>\n
  16. E. Hof and S. Bross, \u201cOn the deterministic-code capacity of the two-user discrete memoryless arbitrarily varying general broadcast channel,\u201d CISS 2005, Baltimore.<\/li>\n
  17. S. Bross and S. Litsyn, \u201cImproved upper bounds for codes with unequal error protection,\u201d ISIT 2005, Adelaide Australia.<\/li>\n
  18. Y. Gabbai and S. Bross, \u201cOn the discrete memoryless relay channel with relay-transmitter feedback,'' ISIT 2006, Seattle USA. <\/li>\n
  19. S. Bross, A. Lapidoth and S. Tinguely, \u201cSuperimposed coded and uncoded transmissions of a Gaussian source over the Gaussian channel,'' ISIT 2006, Seattle USA. <\/li>\n
  20. S. Bross, and M. Wigger, \u201cA Schalkwijk-Kailath type encoding scheme for the Gaussian relay channel with receiver-transmitter feedback,'' ISIT 2007, Nice, France.<\/li>\n
  21. S. Bross, \u201cOn the discrete memoryless partially cooperative broadcast relay channel,'' ISIT 2007, Nice, France.<\/li>\n
  22. S. Bross, A. Lapidoth and S. Tinguely, \u201cBroadcasting correlated Gaussians,'' ISIT 2008, Toronto, Canada. <\/li>\n
  23. S. Bross, A. Lapidoth and M. Wigger, \u201cThe Gaussian MAC with conferencing encoders,'' ISIT 2008, Toronto, Canada. <\/li>\n
  24. S. Bross, and T. Weissman, \u201cOn successive refinement for the Wyner-Ziv problem with partially cooperating decoders,'' ISIT 2008, Toronto, Canada. <\/li>\n
  25. S. Bross, and T. Weissman, \u201cAn outer bound for side-information scalable source coding with partially cooperating decoders,'' ISIT 2009, Seoul, Korea. <\/li>\n
  26. S. Bross, A. Lapidoth and L. Wang, \u201cThe Poisson channel with side information,'' Allerton 2009.<\/li>\n
  27. S. Bross, Y. Steinberg and S. Tinguely, \u201cThe causal cognitive interference channel,'' IZS 2010, Zurich, Switzerland. <\/li>\n
  28. S. Bross, Y. Steinberg and S. Tinguely, \u201cThe discrete memoryless interference channel with one-sided generalized feedback,'' ISIT 2010, Austin, USA. <\/li>\n
  29. S. Bross, and A. Lapidoth, \u201cThe state-dependent multiple-access channel with states available at a cribbing encoder,\u201d IEEE Israel convention Nov. 2010, Eilat.<\/li>\n
  30. S. Bross, Y. Steinberg and S. Tinguely, \u201cThe noisy feedback interference channel with secrecy,\u201d IEEE Israel convention Nov. 2010, Eilat. <\/li>\n
  31. S. Bross, and Y. Steinberg, \u201cThe state-dependent interference channel with states available at a cribbing encoder and one receiver,'' ISIT 2011, St. Petersburg.<\/li>\n
  32. S. I. Bross and H. Permuter, ``On the Gaussian listening-helper source-coding problem,'' IZS 2012, Zurich, Switzerland. <\/li>\n
      \n","protected":false},"excerpt":{"rendered":"

      S. Bross, \u201cError Probability Upper Bound for Two-User Trellis Codes on Multiple-Access Channels\u201d, CISS 1991, Baltimore. S. Bross and Ian F. Blake, \u201cTrellis Codes for the Binary and N-User Adder Channel,\u201d CISS 1992, Princeton. S. I. Bross and I. F. Blake, \u201cUpper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel,\u201d ISIT … Continue reading Conference papers<\/span> →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"onecolumn-page.php","meta":{"footnotes":""},"class_list":["post-18","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.eng.biu.ac.il\/brosss\/wp-json\/wp\/v2\/pages\/18"}],"collection":[{"href":"https:\/\/www.eng.biu.ac.il\/brosss\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.eng.biu.ac.il\/brosss\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.eng.biu.ac.il\/brosss\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.eng.biu.ac.il\/brosss\/wp-json\/wp\/v2\/comments?post=18"}],"version-history":[{"count":6,"href":"https:\/\/www.eng.biu.ac.il\/brosss\/wp-json\/wp\/v2\/pages\/18\/revisions"}],"predecessor-version":[{"id":32,"href":"https:\/\/www.eng.biu.ac.il\/brosss\/wp-json\/wp\/v2\/pages\/18\/revisions\/32"}],"wp:attachment":[{"href":"https:\/\/www.eng.biu.ac.il\/brosss\/wp-json\/wp\/v2\/media?parent=18"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}