Sciweavers

677 search results - page 2 / 136
» On the reconstruction of perfect codes
Sort
View
CISS
2008
IEEE
13 years 11 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman
ARSCOM
2008
110views more  ARSCOM 2008»
13 years 3 months ago
Total Perfect Codes in Tensor Products of Graphs
A total perfect code in a graph is a subset of the graph's vertices with the property that each vertex in the graph is adjacent to exactly one vertex in the subset. We prove t...
Ghidewon Abay-Asmerom, Richard Hammack, Dewey T. T...
DCC
2010
IEEE
14 years 6 days ago
The Non-existence of Length-5 Perfect Slepian-Wolf Codes of Three Sources
—We consider Slepian-Wolf coding of multiple sources and extend the packing bound and the notion of perfect code from conventional channel coding to SW coding with more than two ...
Samuel Cheng, Rick Ma
ICASSP
2008
IEEE
13 years 11 months ago
Algebraic visual cryptography scheme for color images
This paper introduces a novel, cost effective visual cryptography scheme suitable for color image transmission over bandwidth constraint channels. Unlike previously proposed schem...
Mohsen Heidarinejad, Amirhossein Alamdar Yazdi, Ko...
CORR
2012
Springer
171views Education» more  CORR 2012»
12 years 1 months ago
Perfect Reconstruction of Oncogenetic Trees
In this note we provide the necessary and sufficient conditions to uniquely reconstruct an oncogenetic tree.
Charalampos E. Tsourakakis