Ido Tal
From MaRDI portal
Person:2978596
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Polar Codes for the Deletion Channel: Weak and Strong Polarization IEEE Transactions on Information Theory | 2022-07-13 | Paper |
| An Upgrading Algorithm With Optimal Power Law IEEE Transactions on Information Theory | 2022-02-17 | Paper |
| Polar Coding for Processes With Memory IEEE Transactions on Information Theory | 2019-07-19 | Paper |
| Fast Polarization for Processes With Memory IEEE Transactions on Information Theory | 2019-07-19 | Paper |
| A Lower Bound on the Probability of Error of Polar Codes over BMS Channels IEEE Transactions on Information Theory | 2019-07-19 | Paper |
| Greedy–Merge Degrading has Optimal Power-Law IEEE Transactions on Information Theory | 2019-01-28 | Paper |
| A Simple Proof of Fast Polarization IEEE Transactions on Information Theory | 2018-06-27 | Paper |
| On Row-by-Row Coding for 2-D Constraints IEEE Transactions on Information Theory | 2017-08-08 | Paper |
| Bounds on the Rate of 2-D Bit-Stuffing Encoders IEEE Transactions on Information Theory | 2017-07-27 | Paper |
| On the Construction of Polar Codes for Channels With Moderate Input Alphabet Sizes IEEE Transactions on Information Theory | 2017-07-27 | Paper |
| Channel Upgradation for Non-Binary Input Alphabets and MACs IEEE Transactions on Information Theory | 2017-07-27 | Paper |
| Convex Programming Upper Bounds on the Capacity of 2-D Constraints IEEE Transactions on Information Theory | 2017-07-27 | Paper |
| How to Construct Polar Codes IEEE Transactions on Information Theory | 2017-06-08 | Paper |
| List Decoding of Polar Codes IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Research outcomes over time
This page was built for person: Ido Tal
