dc.contributor.author | Gerek, Ömer Nezih | |
dc.contributor.author | Fidan, Mehmet | |
dc.date.accessioned | 2019-10-21T20:11:55Z | |
dc.date.available | 2019-10-21T20:11:55Z | |
dc.date.issued | 2006 | |
dc.identifier.isbn | 978-1-4244-0238-0 | |
dc.identifier.uri | https://hdl.handle.net/11421/20358 | |
dc.identifier.uri | https://dx.doi.org/10.1109/SIU.2006.1659849 | en_US |
dc.description | IEEE 14th Signal Processing and Communications Applications -- APR 16-19, 2006 -- Antalya, TURKEY | en_US |
dc.description | WOS: 000245347800023 | en_US |
dc.description.abstract | The Mycielski predictor is a prediction algorithm that utilizes the infinite past of a data sequence. The algorithm resembles the LZ77 compression method. LZ78, on the other hand, is a dictionary based lossless compression algorithm developed to improve the complexity of LZ77 by eliminating the infinite past search. Since Mycielski predictor uses all of the past samples, its tun time makes it impractical for uses in long data sequences. In this work, an improvement that resembles the LZ78 improvement over LZ77 is proposed for the Mycielski algorithm for data compression. | en_US |
dc.description.sponsorship | IEEE | en_US |
dc.language.iso | tur | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isformatof | 10.1109/SIU.2006.1659849 | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.title | The Mycielski78 compression algorithm | en_US |
dc.type | conferenceObject | en_US |
dc.relation.journal | 2006 IEEE 14th Signal Processing and Communications Applications, Vols 1 and 2 | en_US |
dc.contributor.department | Anadolu Üniversitesi, Mühendislik Fakültesi, Elektrik ve Elektronik Mühendisliği Bölümü | en_US |
dc.identifier.startpage | 89 | en_US |
dc.identifier.endpage | + | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.contributor.institutionauthor | Gerek, Ömer Nezih | |
dc.contributor.institutionauthor | Fidan, Mehmet | |