Sciweavers

314 search results - page 12 / 63
» A Comparison of Known Codes, Random Codes, and the Best Code...
Sort
View
DCC
2005
IEEE
14 years 8 months ago
New Constructions for IPP Codes
Identifiable parent property (IPP) codes are introduced to provide protection against illegal producing of copyrighted digital material. In this paper we consider explicit constru...
Tran van Trung, Sosina Martirosyan
TIT
2008
103views more  TIT 2008»
13 years 8 months ago
Improved Probabilistic Bounds on Stopping Redundancy
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
Junsheng Han, Paul H. Siegel, Alexander Vardy
PPAM
2005
Springer
14 years 2 months ago
Adapting Linear Algebra Codes to the Memory Hierarchy Using a Hypermatrix Scheme
Abstract. We present the way in which we adapt data and computations to the underlying memory hierarchy by means of a hierarchical data structure known as hypermatrix. The applicat...
José R. Herrero, Juan J. Navarro
ECCC
2010
122views more  ECCC 2010»
13 years 7 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
TIT
2002
91views more  TIT 2002»
13 years 8 months ago
On limited-delay lossy coding and filtering of individual sequences
Abstract--We continue the study of adaptive schemes for the sequential lossy coding of individual sequences which was recently initiated by Linder and Lugosi. Specifically, we cons...
Tsachy Weissman, Neri Merhav