Musings about text redundancy and text compression

Gruner, Stefan

UPSpace Home
→
Engineering, Built Environment and Information Technology
→
Computer Science
→
Colloquiums and Festschrifts (At the occasion of the 60th Birthday of Derrick Kourie)
→
View Item

dc.contributor.author	Gruner, Stefan
dc.date.accessioned	2009-03-09T11:23:19Z
dc.date.available	2009-03-09T11:23:19Z
dc.date.created	2008-06-28
dc.date.issued	2009-03-09T11:23:19Z
dc.description	The Post-Proceedings of this Festschrift will be formally published in The South African Computer Journal number 41.
dc.description.abstract	I muse about some “stringological” questions: Is it possible to encode and compress any given string in such a way that all redundancy is removed? And, if this not possible: How closely could we approximate the ideal aim? My little essay is naive in the sense that I have never studied “stringology” and coding theory properly – therefore also no literature references at the end of this paper. The sole purpose of this little sketch is to entertain my colleague Derrick Kourie at the occasion of his 60th birthday, for which I wish him all the best of happiness as well as many further years to come.
dc.identifier.citation	Gruner, S 2008, 'Musings about text redundancy and txt compression', in Colloquium and Festschrift at the occasion of the 60th birthday of Derrick Kourie (Computer Science), Windy Brow, South Afica, 28 June 2008. [http://www.cs.up.ac.za/cs/sgruner/Festschrift/]
dc.identifier.uri	http://hdl.handle.net/2263/9188
dc.language.iso	en	en_US
dc.rights	Stefan Gruner	en_US
dc.subject	Encoding	en_US
dc.subject.lcsh	Coding theory
dc.subject.lcsh	Kourie, Derrick
dc.subject.lcsh	Computer science
dc.title	Musings about text redundancy and text compression	en_US
dc.type	Article	en_US