default search action
Oron Sabag
Person information
- affiliation: Hebrew University, Jerusalem, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Bashar Huleihel
, Oron Sabag
Capacity of Finite-State Channels With Delayed Feedback. IEEE Trans. Inf. Theory 70(1): 16-29 (2024) - [j14]Eli Shemuel
Finite-State Channels With Feedback and State Known at the Encoder. IEEE Trans. Inf. Theory 70(3): 1610-1628 (2024) - [j13]Michael Langberg
Competitive Channel-Capacity. IEEE Trans. Inf. Theory 70(7): 4585-4598 (2024) - [c30]Joudi Hajar, Oron Sabag, Babak Hassibi:
Regret-Optimal Control under Partial Observability. ACC 2024: 4072-4077 - [c29]Michael Langberg, Oron Sabag:
Competitive Analysis of Arbitrary Varying Channels. ISIT 2024: 145-150 - [c28]Bashar Huleihel, Dor Tsur, Ziv Aharoni, Oron Sabag, Haim H. Permuter:
Neural Estimation of Multi-User Capacity Regions Over Discrete Channels. ISIT 2024: 1191-1196 - [c27]Barron Han, Victoria Kostina
Coded Kalman Filtering over MIMO Gaussian Channels with Feedback. ISIT 2024: 3261-3266 - [i24]Bashar Huleihel, Oron Sabag, Ziv Aharoni, Haim H. Permuter:
The Duality Upper Bound for Finite-State Channels with Feedback. CoRR abs/2401.05102 (2024) - [i23]Barron Han, Oron Sabag, Victoria Kostina, Babak Hassibi:
Coded Kalman Filtering over MIMO Gaussian Channels with Feedback. CoRR abs/2406.17196 (2024) - [i22]Michael Langberg, Oron Sabag:
Competitive Analysis of Arbitrary Varying Channels. CoRR abs/2407.02949 (2024) - 2023
- [j12]Oron Sabag
Reducing the LQG Cost With Minimal Communication. IEEE Trans. Autom. Control. 68(9): 5258-5270 (2023) - [j11]Oron Sabag
Feedback Capacity of MIMO Gaussian Channels. IEEE Trans. Inf. Theory 69(10): 6121-6136 (2023) - [c26]Barron Han, Oron Sabag, Victoria Kostina
Coded Kalman Filtering Over Gaussian Channels with Feedback. Allerton 2023: 1-8 - [c25]Michael Langberg, Oron Sabag
Competitive Channel-Capacity. ISIT 2023: 939-944 - [c24]Bashar Huleihel, Dor Tsur, Ziv Aharoni, Oron Sabag
Neural Estimation of Multi-User Capacity Regions. ISIT 2023: 2380-2385 - [i21]Bashar Huleihel, Oron Sabag
Capacity of Finite-State Channels with Delayed Feedback. CoRR abs/2303.18008 (2023) - [i20]Michael Langberg, Oron Sabag:
Competitive Channel-Capacity. CoRR abs/2306.07814 (2023) - [i19]Barron Han, Oron Sabag
Coded Kalman Filtering Over Gaussian Channels with Feedback. CoRR abs/2310.11747 (2023) - [i18]Joudi Hajar, Oron Sabag, Babak Hassibi:
Regret-Optimal Control under Partial Observability. CoRR abs/2311.06433 (2023) - 2022
- [j10]Eli Shemuel
The Feedback Capacity of Noisy Output Is the STate (NOST) Channels. IEEE Trans. Inf. Theory 68(8): 5044-5059 (2022) - [j9]Ziv Aharoni
Feedback Capacity of Ising Channels With Large Alphabet via Reinforcement Learning. IEEE Trans. Inf. Theory 68(9): 5637-5656 (2022) - [j8]Oron Sabag
Regret-Optimal Filtering for Prediction and Estimation. IEEE Trans. Signal Process. 70: 5012-5024 (2022) - [c23]Oron Sabag
Competitive-Ratio and Regret-Optimal Control with General Weights. CDC 2022: 4859-4864 - [c22]Bashar Huleihel, Oron Sabag
Capacity of the Trapdoor Channel with Delayed Feedback. ISIT 2022: 492-497 - [c21]Oron Sabag
Feedback Capacity of Gaussian Channels with Memory. ISIT 2022: 2547-2552 - [i17]Oron Sabag
Optimal Competitive-Ratio Control. CoRR abs/2206.01782 (2022) - [i16]Oron Sabag
Feedback capacity of Gaussian channels with memory. CoRR abs/2207.10580 (2022) - [i15]Eli Shemuel, Oron Sabag
Finite-State Channels with Feedback and State Known at the Encoder. CoRR abs/2212.12886 (2022) - 2021
- [j7]Bashar Huleihel
Computable Upper Bounds on the Capacity of Finite-State Channels. IEEE Trans. Inf. Theory 67(9): 5674-5692 (2021) - [c20]Oron Sabag, Babak Hassibi:
Regret-Optimal Filtering. AISTATS 2021: 2629-2637 - [c19]Oron Sabag
Regret-Optimal Controller for the Full-Information Problem. ACC 2021: 4777-4782 - [c18]Oron Sabag
Feedback Capacity of MIMO Gaussian Channels. ISIT 2021: 7-12 - [i14]Oron Sabag, Babak Hassibi:
Regret-Optimal Filtering. CoRR abs/2101.10357 (2021) - [i13]Oron Sabag, Gautam Goel, Sahin Lale, Babak Hassibi:
Regret-Optimal Full-Information Control. CoRR abs/2105.01244 (2021) - [i12]Oron Sabag, Victoria Kostina, Babak Hassibi:
Feedback Capacity of MIMO Gaussian Channels. CoRR abs/2106.01994 (2021) - [i11]Eli Shemuel, Oron Sabag, Haim H. Permuter:
The Feedback Capacity of Noisy Output is the STate (NOST) Channels. CoRR abs/2107.07164 (2021) - [i10]Oron Sabag, Peida Tian, Victoria Kostina, Babak Hassibi:
Reducing the LQG Cost with Minimal Communication. CoRR abs/2109.12246 (2021) - 2020
- [j6]Oron Sabag
Graph-Based Encoders and Their Performance for Finite-State Channels With Feedback. IEEE Trans. Commun. 68(4): 2106-2117 (2020) - [c17]Oron Sabag
The Minimal Directed Information Needed to Improve the LQG Cost. CDC 2020: 1842-1847 - [c16]Eli Shemuel, Oron Sabag
Feedback Capacity of Finite-State Channels with Causal State Known at the Encoder. ISIT 2020: 2120-2125 - [c15]Oron Sabag
Stabilizing Dynamical Systems with Fixed-Rate Feedback using Constrained Quantizers. ISIT 2020: 2855-2860 - [i9]Ziv Aharoni, Oron Sabag, Haim Henri Permuter:
Computing the Feedback Capacity of Finite State Channels using Reinforcement Learning. CoRR abs/2001.09685 (2020) - [i8]Ziv Aharoni, Oron Sabag, Haim Henri Permuter:
Reinforcement Learning Evaluation and Solution for the Feedback Capacity of the Ising Channel with Large Alphabet. CoRR abs/2008.07983 (2020)
2010 – 2019
- 2019
- [j5]Ori Peled
Feedback Capacity and Coding for the (0, k)-RLL Input-Constrained BEC. IEEE Trans. Inf. Theory 65(7): 4097-4114 (2019) - [c14]Ziv Aharoni, Oron Sabag
Computing the Feedback Capacity of Finite State Channels using Reinforcement Learning. ISIT 2019: 837-841 - [c13]Bashar Huleihel, Oron Sabag
Computable Upper Bounds for Unifilar Finite-State Channels. ISIT 2019: 1892-1896 - [c12]Oron Sabag
Capacity-Achieving Coding Scheme for the MAC with Degraded Message Sets and Feedback. ISIT 2019: 2259-2263 - [i7]Oron Sabag, Bashar Huleihel, Haim H. Permuter:
Graph-Based Encoders and their Performance for Finite-State Channels with Feedback. CoRR abs/1907.08063 (2019) - [i6]Bashar Huleihel, Oron Sabag, Haim H. Permuter, Navin Kashyap, Shlomo Shamai:
Computable Upper Bounds on the Capacity of Finite-State Channels. CoRR abs/1911.02113 (2019) - 2018
- [j4]Oron Sabag
Feedback Capacity and Coding for the BIBO Channel With a No-Repeated-Ones Input Constraint. IEEE Trans. Inf. Theory 64(7): 4940-4961 (2018) - [c11]Oron Sabag
An Achievable Rate Region for the Two-Way Channel with Common Output. Allerton 2018: 527-531 - [c10]Eli Shemuel, Oron Sabag
Finite-State Channel with Feedback and Causal State Information Available at the Encoder. Allerton 2018: 1081-1088 - [c9]Oron Sabag
Graph-based Encoders and their Achievable Rates for Channels with Feedback. ISIT 2018: 1121-1125 - 2017
- [j3]Oron Sabag
Lossless Coding of Correlated Sources With Actions. IEEE Trans. Inf. Theory 63(2): 1237-1252 (2017) - [j2]Oron Sabag
A Single-Letter Upper Bound on the Feedback Capacity of Unifilar Finite-State Channels. IEEE Trans. Inf. Theory 63(3): 1392-1409 (2017) - [c8]Oron Sabag
An optimal coding scheme for the BIBO channel with a no-repeated-ones input constraint. ISIT 2017: 216-220 - [c7]Ori Peled, Oron Sabag
Feedback capacity and coding for the (0, k)-RLL input-constrained BEC. ISIT 2017: 1783-1787 - [i5]Oron Sabag, Haim H. Permuter, Navin Kashyap:
Feedback capacity and coding for the BIBO channel with a no-repeated-ones input constraint. CoRR abs/1701.06174 (2017) - [i4]Ori Peled, Oron Sabag, Haim H. Permuter:
Feedback Capacity and Coding for the (0, k)-RLL Input-Constrained BEC. CoRR abs/1712.02690 (2017) - 2016
- [j1]Oron Sabag
The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint. IEEE Trans. Inf. Theory 62(1): 8-22 (2016) - [c6]Oron Sabag
A single-letter upper bound on the feedback capacity of unifilar finite-state channels. ISIT 2016: 310-314 - [c5]Oron Sabag
The feedback capacity of the BIBO channel with a no-consecutive-ones input constraint. SPCOM 2016: 1-5 - [i3]Oron Sabag, Haim H. Permuter, Henry D. Pfister:
A Single-Letter Upper Bound on the Feedback Capacity of Unifilar Finite-State Channels. CoRR abs/1604.01878 (2016) - 2015
- [c4]Oron Sabag
The feedback capacity of the binary symmetric channel with a no-consecutive-ones input constraint. Allerton 2015: 160-164 - [c3]Oron Sabag
Capacity of the (1, ∞)-RLL input-constrained erasure channel with feedback. ITW 2015: 1-5 - [i2]Oron Sabag, Haim H. Permuter, Navin Kashyap:
The Feedback Capacity of the (1, ∞)-RLL Input-Constrained Erasure Channel. CoRR abs/1503.03359 (2015) - 2014
- [c2]Oron Sabag
Lossless coding of correlated sources with actions in acyclic directed networks. ISIT 2014: 1331-1335 - [i1]Oron Sabag, Haim H. Permuter, Asaf Cohen:
Lossless Coding of Correlated Sources with Actions. CoRR abs/1404.3997 (2014) - 2013
- [c1]Oron Sabag
Correlated sources with actions. Allerton 2013: 869-874
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 01:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: