Sciweavers

406 search results - page 41 / 82
» Pseudorandomness and Combinatorial Constructions
Sort
View
TIT
2010
80views Education» more  TIT 2010»
13 years 5 months ago
Optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4
An optical orthogonal signature pattern code (OOSPC) finds application in transmitting 2-dimensional images through multicore fiber in code-division multiple-access (CDMA) communic...
Masanori Sawa
ICIP
2004
IEEE
15 years 18 days ago
Robust perceptual image hashing via matrix invariants
In this paper we suggest viewing images (as well as attacks on them) as a sequence of linear operators and propose novel hashing algorithms employing transforms that are based on ...
Mehmet Kivanç Mihçak, Ramarathnam Ve...
TIT
2008
164views more  TIT 2008»
13 years 11 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
ISPD
1997
ACM
74views Hardware» more  ISPD 1997»
14 years 3 months ago
A matrix synthesis approach to thermal placement
— In this paper, we consider the thermal placement problem for gate arrays. We introduce a new combinatorial optimization problem, matrix synthesis problem (MSP), to model the th...
Chris C. N. Chu, D. F. Wong
STOC
2000
ACM
123views Algorithms» more  STOC 2000»
14 years 2 months ago
List decoding algorithms for certain concatenated codes
We give efficient (polynomial-time) list-decoding algorithms for certain families of errorcorrecting codes obtained by "concatenation". Specifically, we give list-decodi...
Venkatesan Guruswami, Madhu Sudan