Yaron Shany

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
Efficient algorithms for constructing minimum-weight codewords in some extended binary BCH codes IEEE Transactions on Information Theory	2025-01-23	Paper
Fast syndrome-based chase decoding of binary BCH codes through Wu list decoding IEEE Transactions on Information Theory	2024-07-18	Paper
Repairing Reed–Solomon Codes Evaluated on Subspaces IEEE Transactions on Information Theory	2024-03-14	Paper
A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed–Solomon Codes IEEE Transactions on Information Theory	2022-07-13	Paper
A Note on Nonlinear Xing Codes IEEE Transactions on Information Theory	2008-12-21	Paper
Toward an Explicit Construction of Nonlinear Codes Exceeding the Tsfasman–VlĂduŢ–Zink Bound IEEE Transactions on Information Theory	2008-12-21	Paper
Lower Bounds on the State Complexity of Linear Tail-Biting Trellises IEEE Transactions on Information Theory	2008-12-21	Paper
Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes IEEE Transactions on Information Theory	2000-09-07	Paper
Bounds on the state complexity of codes from the Hermitian function field and its subfields IEEE Transactions on Information Theory	2000-09-07	Paper
The Preparata and Goethals codes: trellis complexity and twisted squaring constructions IEEE Transactions on Information Theory	1999-11-21	Paper
On the trellis representation of the Delsarte-Goethals codes IEEE Transactions on Information Theory	1999-11-21	Paper

Research outcomes over time

This page was built for person: Yaron Shany