<?xml version="1.0"?>
<dblpperson name="Eado Meron" pid="21/4076" n="9">
<person key="homepages/21/4076" mdate="2009-06-10">
<author pid="21/4076">Eado Meron</author>
</person>
<r><article key="journals/tit/ShayevitzMFZ14" mdate="2020-03-10">
<author pid="17/3290">Ofer Shayevitz</author>
<author pid="21/4076">Eado Meron</author>
<author pid="97/1366">Meir Feder</author>
<author pid="11/1342">Ram Zamir</author>
<title>Delay and Redundancy in Lossless Source Coding.</title>
<pages>5470-5485</pages>
<year>2014</year>
<volume>60</volume>
<journal>IEEE Trans. Inf. Theory</journal>
<number>9</number>
<ee>https://doi.org/10.1109/TIT.2014.2331954</ee>
<url>db/journals/tit/tit60.html#ShayevitzMFZ14</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1207-0297" mdate="2018-08-13">
<author pid="21/4076">Eado Meron</author>
<author pid="97/1366">Meir Feder</author>
<author pid="60/10966">Mark Shtaif</author>
<title>On the Achievable Communication Rates of Generalized Soliton Transmission Systems</title>
<ee type="oa">http://arxiv.org/abs/1207.0297</ee>
<year>2012</year>
<journal>CoRR</journal>
<volume>abs/1207.0297</volume>
<url>db/journals/corr/corr1207.html#abs-1207-0297</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1012-4225" mdate="2018-08-13">
<author pid="17/3290">Ofer Shayevitz</author>
<author pid="21/4076">Eado Meron</author>
<author pid="97/1366">Meir Feder</author>
<author pid="11/1342">Ram Zamir</author>
<title>Delay and Redundancy in Lossless Source Coding</title>
<ee type="oa">http://arxiv.org/abs/1012.4225</ee>
<year>2010</year>
<journal>CoRR</journal>
<volume>abs/1012.4225</volume>
<url>db/journals/corr/corr1012.html#abs-1012-4225</url>
</article>
</r>
<r><inproceedings key="conf/dcc/MeronSFZ08" mdate="2023-03-24">
<author pid="21/4076">Eado Meron</author>
<author pid="17/3290">Ofer Shayevitz</author>
<author pid="97/1366">Meir Feder</author>
<author pid="11/1342">Ram Zamir</author>
<title>A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding.</title>
<pages>489-498</pages>
<year>2008</year>
<booktitle>DCC</booktitle>
<ee>https://doi.org/10.1109/DCC.2008.84</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/DCC.2008.84</ee>
<crossref>conf/dcc/2008</crossref>
<url>db/conf/dcc/dcc2008.html#MeronSFZ08</url>
</inproceedings>
</r>
<r><inproceedings key="conf/dcc/ShayevitzMFZ07" mdate="2023-03-24">
<author pid="17/3290">Ofer Shayevitz</author>
<author pid="21/4076">Eado Meron</author>
<author pid="97/1366">Meir Feder</author>
<author pid="11/1342">Ram Zamir</author>
<title>Bounds on Redundancy in Constrained Delay Arithmetic Coding.</title>
<pages>133-142</pages>
<year>2007</year>
<crossref>conf/dcc/2007</crossref>
<booktitle>DCC</booktitle>
<ee>https://doi.org/10.1109/DCC.2007.19</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/DCC.2007.19</ee>
<url>db/conf/dcc/dcc2007.html#ShayevitzMFZ07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icc/MeronF06" mdate="2017-05-25">
<author pid="21/4076">Eado Meron</author>
<author pid="97/1366">Meir Feder</author>
<title>Multi-relay regeneration for long haul communications.</title>
<pages>1628-1632</pages>
<year>2006</year>
<booktitle>ICC</booktitle>
<ee>https://doi.org/10.1109/ICC.2006.255044</ee>
<crossref>conf/icc/2006</crossref>
<url>db/conf/icc/icc2006.html#MeronF06</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isit/MeronF06" mdate="2019-02-13">
<author pid="21/4076">Eado Meron</author>
<author pid="97/1366">Meir Feder</author>
<title>Shrink and Stretch Sequential Scalar (S4) Quantizers.</title>
<pages>582-586</pages>
<year>2006</year>
<booktitle>ISIT</booktitle>
<ee>https://doi.org/10.1109/ISIT.2006.261783</ee>
<crossref>conf/isit/2006</crossref>
<url>db/conf/isit/isit2006.html#MeronF06</url>
</inproceedings>
</r>
<r><article key="journals/tit/MeronF04" mdate="2020-03-10">
<author pid="21/4076">Eado Meron</author>
<author pid="97/1366">Meir Feder</author>
<title>Finite-memory universal prediction of individual sequences.</title>
<pages>1506-1523</pages>
<year>2004</year>
<volume>50</volume>
<journal>IEEE Trans. Inf. Theory</journal>
<number>7</number>
<url>db/journals/tit/tit50.html#MeronF04</url>
<ee>https://doi.org/10.1109/TIT.2004.830749</ee>
</article>
</r>
<r><inproceedings key="conf/dcc/MeronF04" mdate="2023-03-24">
<author pid="21/4076">Eado Meron</author>
<author pid="97/1366">Meir Feder</author>
<title>Optimal Finite State Universal Coding of Individual Sequences.</title>
<pages>332-341</pages>
<year>2004</year>
<crossref>conf/dcc/2004</crossref>
<booktitle>Data Compression Conference</booktitle>
<ee>https://doi.org/10.1109/DCC.2004.1281478</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/DCC.2004.1281478</ee>
<url>db/conf/dcc/dcc2004.html#MeronF04</url>
</inproceedings>
</r>
<coauthors n="4" nc="1">
<co c="0"><na f="f/Feder:Meir" pid="97/1366">Meir Feder</na></co>
<co c="0"><na f="s/Shayevitz:Ofer" pid="17/3290">Ofer Shayevitz</na></co>
<co c="0"><na f="s/Shtaif:Mark" pid="60/10966">Mark Shtaif</na></co>
<co c="0"><na f="z/Zamir:Ram" pid="11/1342">Ram Zamir</na></co>
</coauthors>
</dblpperson>

