By Topic

Compressing inconsistent data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Korner, J. ; Dipartimento di Matematica, Bologna Univ., Italy ; Lucertini, M.

In a frequent practical situation one possesses inconsistent fragmentary data concerning some industrial process or natural phenomenon. It is an interesting and reasonable task to assess what the most concise way to store or transmit them would be. The authors consider the zero-error case of the problem, i.e., we would like to save all the data incorporating them into the most concise but necessarily alternative consistent data structures. More precisely, we want to find a set of alternatives which requires the minimum total storage place. From the mathematical viewpoint the model is information-theoretic and gives a common framework to deal with many combinatorial problems in the theory of extremal hypergraphs. From the practical viewpoint the interest of the mathematical theory is to produce new information measures capturing the inconsistency in the data

Published in:

Information Theory, IEEE Transactions on  (Volume:40 ,  Issue: 3 )