A genetic algorithm approach for verification of the syllable-based text compression technique

Date

1997-01-01

Author

Üçoluk, Göktürk
Toroslu, İsmail Hakkı

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

127
views

0
downloads

Provided that an easy mechanism exists for it, it is possible to decompose a text into strings that have lengths greater than one and occur frequently. Having in one hand the set of such frequently occurring strings and in the other the set of letters and symbols, it is possible to compress the text using Huffman coding over an alphabet which is a subset of the union of these two sets. Observations reveal that, in most cases, the maximal inclusion of the strings leads to an optimal length of compressed text. However, the verification of this prediction requires the consideration of ail subsets in order to find the one that leads to the best compression. A genetic algorithm is devised and used for this search process. In Turkish texts, because of the agglutinative nature of the language, a highly regular syllable formation provides a useful testbed.

Subject Keywords

Library and Information Sciences, Information Systems

URI

https://hdl.handle.net/11511/36507

Journal

JOURNAL OF INFORMATION SCIENCE

DOI

https://doi.org/10.1177/016555159702300503

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

An improvement on the bounds of Weil exponential sums over Gallois rings with some applications Ling, S; Özbudak, Ferruh (Institute of Electrical and Electronics Engineers (IEEE), 2004-10-01) We present an upper bound for Weil-type exponential sums over Galois rings of characteristic p(2) which improves on the analog of the Weil-Carlitz-Uchiyama bound for Galois rings obtained by Kumar, Helleseth, and Calderbank. A more refined bound, expressed in terms of genera of function fields, and an analog of McEliece's theorem on the divisibility of the homogeneous weights of codewords in trace codes over Z(p)2, are also derived. These results lead to an improvement on the estimation of the minimum dista...
Search for Boolean functions with excellent profiles in the rotation symmetric class Kavut, Selcuk; Maitra, Subhamoy; Yucel, Melek D. (Institute of Electrical and Electronics Engineers (IEEE), 2007-05-01) For the first time Boolean functions on 9 variables having nonlinearity 241 are discovered, that remained as an open question in literature for almost three decades. Such functions are found by heuristic search in the space of rotation symmetric Boolean functions (RSBFs). This shows that there exist Boolean functions on n (odd) variables having non, linearity > 2(n-1) - 2 (n-1/2) if and only if n > 7. Using similar search technique, balanced Boolean functions on 9, 10, and 11 variables are attained having a...
Constructing linear unequal error protection codes from algebraic curves Özbudak, Ferruh (Institute of Electrical and Electronics Engineers (IEEE), 2003-06-01) We show that the concept of "generalized algebraic geometry codes" which was recently introduced by Xing, Niederreiter, and Lam gives a natural framework for constructing linear unequal error protection codes.
Weil-Serre Type Bounds for Cyclic Codes GÜNERİ, CEM; Özbudak, Ferruh (Institute of Electrical and Electronics Engineers (IEEE), 2008-12-01) We give a new method in order to obtain Weil-Serre type hounds on the minimum distance of arbitrary cyclic codes over F(pe) of length coprime to p, where e >= 1 is an arbitrary integer. In an earlier paper we obtained Weil-Serre type bounds for such codes only when e = 1 or e = 2 using lengthy explicit factorizations, which seems hopeless to generalize. The new method avoids such explicit factorizations and it produces an effective alternative. Using our method we obtain Weil-Serre type bounds in various ca...
Cyclic codes and reducible additive equations Guneri, Cem; Özbudak, Ferruh (Institute of Electrical and Electronics Engineers (IEEE), 2007-02-01) We prove a Weil-Serre type bound on the number of solutions of a class of reducible additive equations over finite fields. Using the trace representation of cyclic codes, this enables us to write a general estimate for the weights of cyclic codes. We extend Woffmann's weight bound to a larger classes of cyclic codes. In particular, our result is applicable to any cyclic code over F-p and F-p2, where p is an arbitrary prime. Examples indicate that our bound performs very well against the Bose-Chaudhuri-Hocqu...

Citation Formats

G. Üçoluk and İ. H. Toroslu, “A genetic algorithm approach for verification of the syllable-based text compression technique,” JOURNAL OF INFORMATION SCIENCE, pp. 365–372, 1997, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36507.