Skip to Main content Skip to Navigation

hal-00710290v3  Journal articles
Alexander ZehSergey Bezzateev. A New Bound on the Minimum Distance of Cyclic Codes Using Small-Minimum-Distance Cyclic Codes
Designs, Codes and Cryptography, Springer Verlag, 2012, pp.229-246
hal-00689746v4  Conference papers
Alexander ZehSergey Bezzateev. Describing A Cyclic Code by Another Cyclic Code
IEEE International Symposium on Information Theory (ISIT), Jul 2012, Boston, United States. pp.2896-2900, ⟨10.1109/ISIT.2012.6284054⟩
hal-00781310v2  Conference papers
Johan Sebastian Rosenkilde NielsenAlexander Zeh. Multi-Trial Guruswami--Sudan Decoding for Generalised Reed--Solomon Codes
International Workshop on Coding and Cryptography (WCC), Apr 2013, Bergen, Norway
inria-00633205v1  Journal articles
Alexander ZehChristian GentnerDaniel Augot. An Interpolation Procedure for List Decoding Reed--Solomon codes Based on Generalized Key Equations
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2011, 57, pp.5946-5959. ⟨10.1109/TIT.2011.2162160⟩
hal-00647609v1  Conference papers
Alexander ZehChristian Senger. A link between Guruswami-Sudan's list-decoding and decoding of interleaved Reed-Solomon codes
IEEE International Symposium on Information Theory (ISIT), Jun 2010, Austin, United States. pp.1198-1202, ⟨10.1109/ISIT.2010.5513427⟩
hal-00647618v1  Conference papers
Alexander ZehSabine KampfMartin Bossert. On the Equivalence of Sudan-Decoding and Decoding via Virtual Extension to an Interleaved Reed-Solomon Code
International ITG Conference on Source and Channel Coding (SCC), Jan 2010, Siegen, Germany. pp.1-6
hal-00647597v1  Conference papers
Alexander ZehWenhui Li. Decoding Reed-Solomon codes up to the Sudan radius with the Euclidean algorithm
IEEE International Symposium on Information Theory and its Applications (ISITA), Oct 2010, Taichung, Taiwan. pp.986-990, ⟨10.1109/ISITA.2010.5649520⟩
hal-00647605v1  Conference papers
Christian SengerSteffen SchoberTong MaoAlexander Zeh. End-to-End algebraic network coding for wireless TCP/IP networks
IEEE International Conference on Telecommunications (ICT), Jul 2010, Doha, Qatar. pp.607-612, ⟨10.1109/ICTEL.2010.5478841⟩
pastel-00866134v1  Theses
Alexander Zeh. Algebraic Soft- and Hard-Decision Decoding of Generalized Reed--Solomon and Cyclic Codes
Computational Complexity [cs.CC]. Ecole Polytechnique X, 2013. English
inria-00509209v1  Conference papers
Daniel AugotAlexander Zeh. On the Roth and Ruckenstein equations for the Guruswami-Sudan algorithm
Information Theory, 2008. ISIT 2008. IEEE International Symposium on, Jul 2008, Toronto, Canada. pp.2620-2624, ⟨10.1109/ISIT.2008.4595466⟩
hal-00647586v1  Journal articles
Alexander ZehAntonia Wachter-Zeh. Fast Multi-Sequence Shift-Register Synthesis with the Euclidean Algorithm
Advances in Mathematics of Communications, AIMS, 2011, 5 (4), pp.667-680. ⟨10.3934/amc.2011.5.667⟩
hal-00647590v1  Conference papers
Alexander ZehAntonia Wachter-ZehSergey Bezzateev. Efficient decoding of some classes of binary cyclic codes beyond the Hartmann-Tzeng bound
IEEE International Symposium on Information Theory (ISIT), Jul 2011, St. Petersburg, Russia. pp.1017-1021, ⟨10.1109/ISIT.2011.6033683⟩
hal-00828083v1  Conference papers
Alexander ZehAntonia Wachter-ZehMaximilien GadouleauSergey Bezzateev. Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes
IEEE International Symposium on Information Theory (ISIT), Jul 2013, Istanbul, Turkey. pp.1-6