default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIdo Tal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c20]Boaz Shuval, Ido Tal:
Strong Polarization for Shortened and Punctured Polar Codes. ISIT 2024: 2198-2203- [i24]Boaz Shuval, Ido Tal:
Strong Polarization for Shortened and Punctured Polar Codes. CoRR abs/2401.16833 (2024) - 2023
- [j17]Tuvi Etzion, Paul H. Siegel
, Han Mao Kiah, Hessam Mahdavifar, Farzad Parvaresh, Moshe Schwartz, Ido Tal, Eitan Yaakobi, Xinmiao Zhang:
Dimensions of Channel Coding: From Theory to Algorithms to Applications. IEEE J. Sel. Areas Inf. Theory 4: v-xiii (2023) - [c19]Dar Arava, Ido Tal:
Stronger Polarization for the Deletion Channel. ISIT 2023: 1711-1716 - [i23]Dar Arava, Ido Tal:
Stronger Polarization for the Deletion Channel. CoRR abs/2305.10155 (2023) - 2022
- [j16]Ido Tal, Henry D. Pfister, Arman Fazeli, Alexander Vardy:
Polar Codes for the Deletion Channel: Weak and Strong Polarization. IEEE Trans. Inf. Theory 68(4): 2239-2265 (2022) - 2021
- [j15]Or Ordentlich, Ido Tal:
An Upgrading Algorithm With Optimal Power Law. IEEE Trans. Inf. Theory 67(12): 7822-7836 (2021) - [c18]Henry D. Pfister, Ido Tal:
Polar Codes for Channels with Insertions, Deletions, and Substitutions. ISIT 2021: 2554-2559 - [i22]Henry D. Pfister, Ido Tal:
Polar Codes for Channels with Insertions, Deletions, and Substitutions. CoRR abs/2102.02155 (2021) - 2020
- [c17]Boaz Shuval, Ido Tal:
List Decoding of Universal Polar Codes. ISIT 2020: 389-394 - [i21]Boaz Shuval, Ido Tal:
List Decoding of Universal Polar Codes. CoRR abs/2001.03784 (2020) - [i20]Or Ordentlich, Ido Tal:
An Upgrading Algorithm with Optimal Power Law. CoRR abs/2004.00869 (2020)
2010 – 2019
- 2019
- [j14]Assaf Kartowsky, Ido Tal:
Greedy-Merge Degrading has Optimal Power-Law. IEEE Trans. Inf. Theory 65(2): 917-934 (2019) - [j13]Eren Sasoglu, Ido Tal:
Polar Coding for Processes With Memory. IEEE Trans. Inf. Theory 65(4): 1994-2003 (2019) - [j12]Boaz Shuval, Ido Tal:
Fast Polarization for Processes With Memory. IEEE Trans. Inf. Theory 65(4): 2004-2020 (2019) - [j11]Boaz Shuval, Ido Tal:
A Lower Bound on the Probability of Error of Polar Codes over BMS Channels. IEEE Trans. Inf. Theory 65(4): 2021-2045 (2019) - [c16]Ido Tal, Henry D. Pfister, Arman Fazeli, Alexander Vardy:
Polar Codes for the Deletion Channel: Weak and Strong Polarization. ISIT 2019: 1362-1366 - [c15]Boaz Shuval, Ido Tal:
Universal Polarization for Processes with Memory. ISIT 2019: 2089-2093 - [i19]Ido Tal, Henry D. Pfister, Arman Fazeli, Alexander Vardy:
Polar Codes for the Deletion Channel: Weak and Strong Polarization. CoRR abs/1904.13385 (2019) - 2018
- [c14]Boaz Shuval, Ido Tal:
Fast Polarization for Processes with Memory. ISIT 2018: 851-855 - [i18]Boaz Shuval, Ido Tal:
Universal Polarization for Processes with Memory. CoRR abs/1811.05727 (2018) - 2017
- [j10]Uzi Pereg, Ido Tal:
Channel Upgradation for Non-Binary Input Alphabets and MACs. IEEE Trans. Inf. Theory 63(3): 1410-1424 (2017) - [j9]Ido Tal:
On the Construction of Polar Codes for Channels With Moderate Input Alphabet Sizes. IEEE Trans. Inf. Theory 63(3): 1501-1509 (2017) - [j8]Ido Tal:
A Simple Proof of Fast Polarization. IEEE Trans. Inf. Theory 63(12): 7617-7619 (2017) - [c13]Boaz Shuval, Ido Tal:
A lower bound on the probability of error of polar codes over BMS channels. ISIT 2017: 854-858 - [c12]Assaf Kartowsky, Ido Tal:
Greedy-merge degrading has optimal power-law. ISIT 2017: 1618-1622 - [i17]Boaz Shuval, Ido Tal:
A Lower Bound on the Probability of Error of Polar Codes over BMS Channels. CoRR abs/1701.01628 (2017) - [i16]Assaf Kartowsky, Ido Tal:
Greedy-Merge Degrading has Optimal Power-Law. CoRR abs/1701.02119 (2017) - [i15]Assaf Kartowsky, Ido Tal:
Greedy-Merge Degrading has Optimal Power-Law. CoRR abs/1703.04923 (2017) - [i14]Ido Tal:
A Simple Proof of Fast Polarization. CoRR abs/1704.07179 (2017) - [i13]Boaz Shuval, Ido Tal:
Fast Polarization for Processes with Memory. CoRR abs/1710.02849 (2017) - 2016
- [j7]Gabi Sarkis, Ido Tal, Pascal Giard, Alexander Vardy, Claude Thibeault, Warren J. Gross:
Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes. IEEE Trans. Commun. 64(7): 2732-2745 (2016) - [c11]Eren Sasoglu, Ido Tal:
Polar coding for processes with memory. ISIT 2016: 225-229 - [i12]Eren Sasoglu, Ido Tal:
Polar Coding for Processes with Memory. CoRR abs/1602.01870 (2016) - 2015
- [j6]Ido Tal, Alexander Vardy:
List Decoding of Polar Codes. IEEE Trans. Inf. Theory 61(5): 2213-2226 (2015) - [c10]Ido Tal:
On the construction of polar codes for channels with moderate input alphabet sizes. ISIT 2015: 1297-1301 - [i11]Ido Tal:
On the Construction of Polar Codes for Channels with Moderate Input Alphabet Sizes. CoRR abs/1506.08370 (2015) - [i10]Gabi Sarkis, Ido Tal, Pascal Giard, Alexander Vardy, Claude Thibeault, Warren J. Gross:
Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes. CoRR abs/1507.03614 (2015) - 2014
- [c9]Uzi Pereg, Ido Tal:
Channel upgradation for non-binary input alphabets and MACs. ISIT 2014: 411-415 - 2013
- [j5]Ido Tal, Alexander Vardy:
How to Construct Polar Codes. IEEE Trans. Inf. Theory 59(10): 6562-6582 (2013) - [c8]Ido Tal, Alexander Vardy:
Channel upgrading for semantically-secure encryption on wiretap channels. ISIT 2013: 1561-1565 - [i9]Uzi Pereg, Ido Tal:
Channel Upgradation for Non-Binary Input Alphabets and MACs. CoRR abs/1308.5793 (2013) - 2012
- [j4]Camille Leroux, Alexandre J. Raymond, Gabi Sarkis, Ido Tal, Alexander Vardy, Warren J. Gross:
Hardware Implementation of Successive-Cancellation Decoders for Polar Codes. J. Signal Process. Syst. 69(3): 305-315 (2012) - [c7]Ido Tal, Artyom Sharov, Alexander Vardy:
Constructing polar codes for non-binary alphabets and MACs. ISIT 2012: 2132-2136 - [i8]Ido Tal, Alexander Vardy:
List Decoding of Polar Codes. CoRR abs/1206.0050 (2012) - [i7]Ramtin Pedarsani, Seyed Hamed Hassani, Ido Tal, Emre Telatar:
On the Construction of Polar Codes. CoRR abs/1209.4444 (2012) - 2011
- [j3]Ido Tal, Ron M. Roth:
Convex Programming Upper Bounds on the Capacity of 2-D Constraints. IEEE Trans. Inf. Theory 57(1): 381-391 (2011) - [c6]Camille Leroux, Ido Tal, Alexander Vardy, Warren J. Gross:
Hardware architectures for successive cancellation decoding of polar codes. ICASSP 2011: 1665-1668 - [c5]Ido Tal, Alexander Vardy:
List decoding of polar codes. ISIT 2011: 1-5 - [c4]Ramtin Pedarsani, Seyed Hamed Hassani, Ido Tal, Emre Telatar:
On the construction of polar codes. ISIT 2011: 11-15 - [i6]Ido Tal, Alexander Vardy:
How to Construct Polar Codes. CoRR abs/1105.6164 (2011) - [i5]Camille Leroux, Alexandre J. Raymond, Gabi Sarkis, Ido Tal, Alexander Vardy, Warren J. Gross:
Hardware Implementation of Successive Cancellation Decoders for Polar Codes. CoRR abs/1111.4362 (2011) - 2010
- [j2]Ido Tal, Ron M. Roth:
Bounds on the rate of 2-D bit-stuffing encoders. IEEE Trans. Inf. Theory 56(6): 2561-2567 (2010) - [i4]Camille Leroux, Ido Tal, Alexander Vardy, Warren J. Gross:
Hardware architectures for Successive Cancellation Decoding of Polar Codes. CoRR abs/1011.2919 (2010)
2000 – 2009
- 2009
- [b1]Ido Tal:
Coding and bounds for two-dimensional constraints. Technion - Israel Institute of Technology, Israel, 2009 - [j1]Ido Tal, Tuvi Etzion, Ron M. Roth:
On row-by-row coding for 2-D constraints. IEEE Trans. Inf. Theory 55(8): 3565-3576 (2009) - [c3]Ron M. Roth, Ido Tal:
Concave programming upper bounds on the capacity of 2-D constraints. ISIT 2009: 1060-1064 - [i3]Ido Tal, Ron M. Roth:
Bounds on the Rate of 2-D Bit-Stuffing Encoders. CoRR abs/0906.2372 (2009) - 2008
- [c2]Ido Tal, Ron M. Roth:
Bounds on the rate of 2-D bit-stuffing encoders. ISIT 2008: 1463-1467 - [i2]Ido Tal, Ron M. Roth:
Concave Programming Upper Bounds on the Capacity of 2-D Constraints. CoRR abs/0801.1126 (2008) - [i1]Ido Tal, Tuvi Etzion, Ron M. Roth:
On row-by-row coding for 2-D constraints. CoRR abs/0808.0596 (2008) - 2006
- [c1]Ido Tal, Tuvi Etzion, Ron M. Roth:
On Row-by-Row Coding for 2-D Constraints. ISIT 2006: 1204-1208
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 2025-01-20 23:04 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:
