{"id":14,"date":"2012-05-08T15:41:47","date_gmt":"2012-05-08T12:41:47","guid":{"rendered":"http:\/\/www.eng.biu.ac.il\/brosss\/?page_id=14"},"modified":"2012-05-08T15:47:27","modified_gmt":"2012-05-08T12:47:27","slug":"publications","status":"publish","type":"page","link":"https:\/\/www.eng.biu.ac.il\/brosss\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"<p><strong>Theses<\/strong><\/p>\n<p>\u201cTrellis Coding for the Two-User Multiple-Access Channel\u201d, Ph.D. Dissertation, E.E. Dept. University of Maryland, August 1991.<\/p>\n<p>\u201cAsymptotic Bounds on the Minimal Error in Nonlinear Filtering\u201d, M.Sc. Thesis, Faculty of Electrical Engineering, Technion\u2014Israel Institute of Technology, May 1983.<\/p>\n<p><strong>Refereed Journal Papers<\/strong><\/p>\n<ol>\n<li>S. I. Bross, \u201cTrellis Coding for the Two-User Multiple-Access Channel, Part I: An Error Probability Upper Bound,\u201d Journal of Combinatorics Information and System Sciences, vol. 19, pp. 241\u2013265, 1995.<\/li>\n<li>S. I. Bross, \u201cTrellis Coding for the Two-User Multiple-Access Channel, Part II: A Free Distance Lower Bound,\u201d Journal of Combinatorics Information and System Sciences, vol. 19, pp. 183\u2013206, 1995.<\/li>\n<li>S. I. Bross, \u201cUnit-Memory Codes for Continuous Phase Modulation in an AWGN Channel,\u201d IEEE Transactions on Communications, vol. COM-43 no. 2, pp. 261\u2013269 Feb. 1995. <\/li>\n<li>S. I. Bross and I. F. Blake, \u201cUpper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel,\u201d IEEE Trans. on Inform. Theory, vol. IT\u201344, no. 1, pp. 334-340 Jan. 1998.  <\/li>\n<li>S. I. Bross, M. Burnashev and S. Shamai (Shitz), \u201cError exponents for the two-user Poisson multiple-access Channel,\u201d IEEE Trans. on Inform. Theory, vol. IT\u201347 no. 5, pp. 1999-2016 July 2001.  <\/li>\n<li>S. I. Bross and S. Shamai (Shitz), \u201cCapacity and decoding rules for the Poisson arbitrarily varying channel,\u201d IEEE Trans. on Inform. Theory, vol. IT\u201349 no. 11, pp. 3076-3093, November 2003. <\/li>\n<li>Sokolovsky and S. I. Bross, \u201cAttainable error exponents for the Poisson broadcast channel with degraded message sets,\u201d IEEE Trans. on Inform. Theory, vol. IT\u201351 no. 1, pp. 364-374, Jan. 2005.  <\/li>\n<li>S. I. Bross and A. Lapidoth, \u201cAn improved achievable region for the discrete memoryless two-user multiple-access channel with noiseless feedback,\u201d IEEE Trans. on Inform. Theory, vol. IT\u201351 no. 3, pp. 811-833, March 2005.  <\/li>\n<li>B. Haddad and S. I. Bross, \u201cAmplitude modulated multi-pulse PPM for bandwidth-limited optical systems,\u201d European Transactions on Telecommunications, vol. 17 no. 1, pp. 63-75, January\/February 2006. <\/li>\n<li>S. I. Bross and S. Litsyn, \u201cImproved upper bounds for codes with unequal error       protection,\u201d IEEE Trans. on Inform. Theory, vol. IT\u201352 no. 7, pp. 3329-3333, July 2006.  <\/li>\n<li>S. I. Bross, ``A converse result for the discrete memoryless relay channel with relay-transmitter feedback,\u201d IEEE Trans. on Inform. Theory, vol. IT\u201352 no. 8, pp. 3789-3792, August 2006. <\/li>\n<li>G. Nakibly and S. Bross, \u201cOn the reliability exponents of two discrete-time timing channel models,\u201d IEEE Trans. on Inform. Theory, vol. IT\u201352 no. 9, pp. 4320-4335, September 2006.  <\/li>\n<li>E. Hof and S. I. Bross, \u201cOn the deterministic-code capacity of the two-user discrete memoryless arbitrarily varying general broadcast channel with degraded message sets,\u201d IEEE Trans. on Inform. Theory, vol. IT\u201352 no. 11, pp. 5023-5044, November 2006. <\/li>\n<li>Y. Gabbai and S. I. Bross, \u201cAchievable rates for partial feedback configurations of the discrete memoryless relay channel,\u201d IEEE Transactions on Information Theory, vol. IT\u201352 no. 11, pp. 4989-5007, November 2006.  <\/li>\n<li>Y. Ovadia and S. I. Bross, \u201cOn the reliability exponent of the additive exponential noise channel,\u201d Problems of Information Transmission, vol. 42, no. 4, pp. 298-318, October-December 2006.<\/li>\n<li>S. Ronen, S. I. Bross, S. Shamai (Shitz) and T. M. Duman, \u201cIterative channel estimation and decoding in turbo coded space-time systems,\u201d European Transactions on Telecommunications s, vol. 18 no. 7, pp. 719-734, October 2007.<\/li>\n<li> S. I. Bross and M. Wigger, \u201cOn the relay channel with receiver-transmitter feedback,\u201d IEEE Transactions on Information Theory, vol. IT\u201355 no. 1, pp. 275-291, Jan. 2009.<\/li>\n<li>S. I. Bross, \u201cOn the discrete memoryless partially cooperative relay broadcast channel and the broadcast channel with cooperating decoders,\u201d IEEE Transactions on Information Theory, vol. IT\u201355 no. 5, pp. 2161-2182, May 2009.<\/li>\n<li>S. I. Bross, Amos Lapidoth and Stephane Tinguely, \u201cBroadcasting correlated Gaussians,\u201d IEEE Transactions on Information Theory, vol. IT\u201356 no. 7, pp. 3057-3068, July 2010.  <\/li>\n<li>S. I. Bross, Amos Lapidoth and M. Wigger, \u201cDirty-paper coding for the multi-access channel with conferencing,\u201d accepted for publication in IEEE Transactions on Information Theory.  <\/li>\n<\/ol>\n<p><strong>Submitted Papers<\/strong><\/p>\n<ol>\n<li>S. I. Bross, Y. Steinberg and S. Tinguely, \u201cThe discrete memoryless interference channel with one-sided generalized feedback,\u201d  submitted to IEEE Transactions on Information Theory, July 2011.<\/li>\n<li>S. I. Bross, and Y. Steinberg, \u201cThe state-dependent interference channel with state available at a cribbing encoder and one receiver,\u201d submitted to IEEE Transactions on Information Theory, December 2011.<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"<p>Theses \u201cTrellis Coding for the Two-User Multiple-Access Channel\u201d, Ph.D. Dissertation, E.E. Dept. University of Maryland, August 1991. \u201cAsymptotic Bounds on the Minimal Error in Nonlinear Filtering\u201d, M.Sc. Thesis, Faculty of Electrical Engineering, Technion\u2014Israel Institute of Technology, May 1983. Refereed Journal Papers S. I. Bross, \u201cTrellis Coding for the Two-User Multiple-Access Channel, Part I: An Error &hellip; <a href=\"https:\/\/www.eng.biu.ac.il\/brosss\/publications\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">Publications<\/span> <span class=\"meta-nav\">&rarr;<\/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-14","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.eng.biu.ac.il\/brosss\/wp-json\/wp\/v2\/pages\/14"}],"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=14"}],"version-history":[{"count":5,"href":"https:\/\/www.eng.biu.ac.il\/brosss\/wp-json\/wp\/v2\/pages\/14\/revisions"}],"predecessor-version":[{"id":30,"href":"https:\/\/www.eng.biu.ac.il\/brosss\/wp-json\/wp\/v2\/pages\/14\/revisions\/30"}],"wp:attachment":[{"href":"https:\/\/www.eng.biu.ac.il\/brosss\/wp-json\/wp\/v2\/media?parent=14"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}