Sciweavers

170 search results - page 4 / 34
» Constructing Small-Bias Sets from Algebraic-Geometric Codes
Sort
View
SIAMDM
1998
86views more  SIAMDM 1998»
13 years 10 months ago
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
In this paper, we investigate combinatorialproperties and constructions of two recent topics of cryptographic interest, namely frameproof codes for digital ngerprinting, and trace...
Douglas R. Stinson, Ruizhong Wei
APPROX
2005
Springer
79views Algorithms» more  APPROX 2005»
14 years 4 months ago
Reconstructive Dispersers and Hitting Set Generators
Abstract. We give a generic construction of an optimal hitting set generator (HSG) from any good “reconstructive” disperser. Past constructions of optimal HSGs have been based ...
Christopher Umans
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 11 months ago
Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes
In this paper, a simple and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method co...
Enrico Paolini, Marco Chiani
DM
2008
125views more  DM 2008»
13 years 11 months ago
Difference systems of sets and cyclotomy
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code synchronization. A method for the construction of DSS from partitions of cycli...
Yukiyasu Mutoh, Vladimir D. Tonchev
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 11 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin