Ido Tal
Ido Tal
Adresse e-mail validée de ee.technion.ac.il - Page d'accueil
Titre
Citée par
Citée par
Année
List decoding of polar codes
I Tal, A Vardy
Information Theory, IEEE Transactions on 61 (5), 2213-2226, 2015
12952015
How to construct polar codes
I Tal, A Vardy
IEEE Transactions on Information Theory 59 (10), 6562-6582, 2013
6452013
Hardware implementation of successive-cancellation decoders for polar codes
C Leroux, AJ Raymond, G Sarkis, I Tal, A Vardy, WJ Gross
Journal of Signal Processing Systems 69 (3), 305-315, 2012
269*2012
On the construction of polar codes
R Pedarsani, SH Hassani, I Tal, E Telatar
2011 IEEE International Symposium on Information Theory Proceedings, 11-15, 2011
1222011
Flexible and low-complexity encoding and decoding of systematic polar codes
G Sarkis, I Tal, P Giard, A Vardy, C Thibeault, WJ Gross
IEEE Transactions on Communications 64 (7), 2732-2745, 2016
762016
Methods and systems for decoding polar codes
W Gross, G Sarkis, A Raymond, C Leroux, I Tal, A Vardy
US Patent 9,176,927, 2015
582015
ECC polar coding and list decoding methods and codecs
A Vardy, I Tal
US Patent 9,503,126, 2016
522016
Constructing polar codes for non-binary alphabets and MACs
I Tal, A Sharov, A Vardy
2012 IEEE International Symposium on Information Theory Proceedings, 2132-2136, 2012
322012
On row-by-row coding for 2-D constraints
I Tal, T Etzion, RM Roth
IEEE transactions on information theory 55 (8), 3565-3576, 2009
312009
Polar coding for processes with memory
E Şaşoğlu, I Tal
IEEE Transactions on Information Theory 65 (4), 1994-2003, 2019
212019
Channel upgrading for semantically-secure encryption on wiretap channels
I Tal, A Vardy
2013 IEEE International Symposium on Information Theory, 1561-1565, 2013
202013
Bounds on the rate of 2-D bit-stuffing encoders
I Tal, RM Roth
2008 IEEE International Symposium on Information Theory, 1463-1467, 2008
202008
On the construction of polar codes for channels with moderate input alphabet sizes
I Tal
IEEE Transactions on Information Theory 63 (3), 1501-1509, 2017
192017
Fast polarization for processes with memory
B Shuval, I Tal
IEEE Transactions on Information Theory 65 (4), 2004-2020, 2018
172018
Channel upgradation for non-binary input alphabets and MACs
U Pereg, I Tal
IEEE Transactions on Information Theory 63 (3), 1410-1424, 2017
172017
Greedy–Merge Degrading has Optimal Power-Law
A Kartowsky, I Tal
IEEE Transactions on Information Theory 65 (2), 917-934, 2018
162018
On list decoding of alternant codes in the Hamming and Lee metrics
I Tal, RM Roth
IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 364-364, 2003
122003
A simple proof of fast polarization
I Tal
IEEE Transactions on Information Theory 63 (12), 7617-7619, 2017
102017
Convex programming upper bounds on the capacity of 2-D constraints
I Tal, RM Roth
IEEE transactions on information theory 57 (1), 381-391, 2010
102010
Polar codes for the deletion channel: Weak and strong polarization
I Tal, HD Pfister, A Fazeli, A Vardy
2019 IEEE International Symposium on Information Theory (ISIT), 1362-1366, 2019
42019
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20