Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CORR
2016
Springer

favoriteEmaildiscussreport

75views Education» more CORR 2016»

Compressing combinatorial objects

8 years 1 months ago

Compressing combinatorial objects

Download cstein.kings.cam.ac.uk

Most of the world’s digital data is currently encoded in a sequential form, and compression methods for sequences have been studied extensively. However, there are many types of nonsequential data for which good compression techniques are still largely unexplored. This paper contributes insights and concrete techniques for compressing various kinds of nonsequential data via arithmetic coding, and derives re-usable probabilistic data models from fairly generic structural assumptions. Near-optimal compression methods are described for certain types of permutations, combinations and multisets; and the conditions for optimality are made explicit for each method.

Christian Steinruecken

Real-time Traffic

CORR 2016 | Education |

claim paper

Related Content

» The Design of ESSENCE A Constraint Language for Specifying Combinatorial Problems

» Essence A constraint language for specifying combinatorial problems

» Tabloids and weighted sums of characters of certain modules of the symmetric groups

» Threshold arrangements and the knapsack problem

» The method of combinatorial telescoping

» Efficient Encoding of ND Combinatorial Pyramids

» A First Step toward Combinatorial Pyramids in nD Spaces

» Video Compression and Retrieval of Moving Object Location Applied to Surveillance

» Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers

» A General Framework for Designing Approximation Schemes for Combinatorial Optimization Pro...

Post Info
More Details (n/a)

Added	31 Mar 2016
Updated	31 Mar 2016
Type	Journal
Year	2016
Where	CORR
Authors	Christian Steinruecken

Comments (0)