DCC 2005 - PDF Preprint Papers

DCC 2005 Data Compression Conference

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DCC-2005 Paper

click to vote

DCC
2005
IEEE

482views Computer Graphics» more DCC 2005»

XOR-based Visual Cryptography Schemes

14 years 11 months ago

Download alexandria.tue.nl

A recent publication introduced a Visual Crypto (VC) system, based on the polarisation of light. This VC system has good resolution, contrast and colour properties. Mathematically,...

Pim Tuyls, Henk D. L. Hollmann, Jack H. van Lint, ...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	482	XOR-based Visual Cryptography Schemes	claim
2	167	Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity	claim
3	155	Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding	claim
4	148	The Markov Expert for Finding Episodes in Time Series	claim
5	142	Signcryption with Non-interactive Non-repudiation	claim
6	141	A Flexible Compressed Text Retrieval System Using a Modified LZW Algorithm	claim
7	140	Distributed Source Coding in Dense Sensor Networks	claim
8	138	Lossless Hyperspectral Image Compression Using Context-Based Conditional Averages	claim
9	138	Asymptotics of the Entropy Rate for a Hidden Markov Process	claim
10	134	The Combinatorics of Dom de Caen	claim
11	130	Towards Practical Minimum-Entropy Universal Decoding	claim
12	127	Optimized Prediction for Geometry Compression of Triangle Meshes	claim
13	124	Error Concealment for Dual Frame Video Coding with Uneven Quality	claim
14	124	Two-Level Directory based Compression	claim
15	123	The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments	claim
16	122	Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults	claim
17	122	A Block-Based Inter-Band Lossless Hyperspectral Image Compressor	claim
18	121	Progressive Low Bit Rate Coding of Simple 3D Objects with Matching Pursuit	claim
19	121	JPEG2000 and Motion JPEG2000 Content Analysis Using Codestream Length Information	claim
20	120	Hyperelliptic Curves with Compact Parameters	claim
21	120	One (96, 20, 4)-symmetric Design and related Nonabelian Difference Sets	claim
22	118	A Note on the Tight Spherical 7-Design in R23 and 5-Design in R7*	claim
23	118	On the Performance of Linear Slepian-Wolf Codes for Correlated Stationary Memoryless Sources	claim
24	117	Extendability of Ternary Linear Codes	claim
25	117	When is Bit Allocation for Predictive Video Coding Easy?	claim
26	114	Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces	claim
27	114	Efficient Inter-Band Prediction and Wavelet Based Compression for Hyperspectral Imagery: A Distributed Source Coding Approach	claim
28	113	TetStreamer: Compressed Back-to-Front Transmission of Delaunay Tetrahedra Meshes	claim
29	112	Double Arrays, Triple Arrays and Balanced Grids	claim
30	109	A Point-Set Compression Heuristic for Fiber-Based Certificates of Authenticity	claim
31	108	Weierstrass Semigroups and Codes from a Quotient of the Hermitian Curve	claim
32	106	Real, Tight Frames with Maximal Robustness to Erasures	claim
33	105	Fast Index Assignment for Balanced N-Description Scalar Quantization	claim
34	104	Of Lempel-Ziv-Welch Parses with Refillable Gaps	claim
35	104	Efficient String Matching Algorithms for Combinatorial Universal Denoising	claim
36	100	On Goppa Codes and Weierstrass Gaps at Several Points	claim
37	99	On the Existence of Large Sets of t-designs of Prime Sizes	claim
38	99	Binary Codes for Non-Uniform Sources	claim
39	98	Support Weight Enumerators and Coset Weight Distributions of Isodual Codes	claim
40	98	Lossless Data Compression Using Optimal Tree Machines	claim
41	96	A Family of Complete Caps in PG(n, 2)	claim
42	96	New Constructions for IPP Codes	claim
43	96	Very Low Frame-Rate Video Streaming For Face-to-Face Teleconference	claim
44	94	Double Arrays, Triple Arrays and Balanced Grids with v=r+c - 1	claim
45	92	A Family of Binary (t, m, s)-Nets of Strength 5	claim
46	91	On the Entropy Rate of Pattern Processes	claim
47	89	Source Coding for a Multihop Network	claim
48	88	Using 2: 1 Shannon Mapping for Joint Source-Channel Coding	claim
49	81	Quantization of Multiple Sources Using Integer Bit Allocation	claim
50	78	Hyperbolic Fibrations and q-Clans	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers