| 2025 | ISIT | Efficient Polar Systematic Encoding Without the Domination Contiguity Property. | Idan Dekel, Yaron Shany, Ariel Doubchak, Amit Berman |
| 2025 | ISIT | Extension of the Poltyrev Bound to Binary Memoryless Symmetric Channels. | Tal Philosof, Ariel Doubchak, Amit Berman, Uri Erez |
| 2024 | ISIT | Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity. | Amit Berman, Yaron Shany, Itzhak Tamo |
| 2021 | ISIT | Repairing Reed-Solomon Codes Evaluated on Subspaces. | Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo |
| 2013 | GLOBECOM | Minimal Maximum-Level Programming: Faster memory access via multi-level cell sharing. | Amit Berman, Yitzhak Birk |
| 2013 | ISIT | Retired-page utilization in write-once memory - A coding perspective. | Amit Berman, Yitzhak Birk |
| 2013 | ISIT | Compression for fixed-width memories. | Ori Rottenstreich, Amit Berman, Yuval Cassuto, Isaac Keslassy |
| 2011 | ISIT | Constrained Flash memory programming. | Amit Berman, Yitzhak Birk |
| 2009 | ICCD | Low-overhead error detection for Networks-on-Chip. | Amit Berman, Idit Keidar |