Sciweavers

19 search results - page 3 / 4
» On the Duals of Binary Hyper-Kloosterman Codes
Sort
View
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 6 months ago
On the Peak-to-Mean Envelope Power Ratio of Phase-Shifted Binary Codes
The peak-to-mean envelope power ratio (PMEPR) of a code employed in orthogonal frequencydivision multiplexing (OFDM) systems can be reduced by permuting its coordinates and by rot...
Kai-Uwe Schmidt
PADL
2010
Springer
14 years 3 months ago
ActionScript In-Lined Reference Monitoring in Prolog
Abstract. A Prolog implementation of an In-lined Reference Monitoring system prototype for Adobe ActionScript Bytecode programs is presented. Prolog provides an elegant framework f...
Meera Sridhar, Kevin W. Hamlen
ITCC
2000
IEEE
13 years 10 months ago
Simple Collusion-Secure Fingerprinting Schemes for Images
This paper describes a robust watermarking algorithm and a collusion-secure fingerprinting scheme based on it. Watermarking robustness is obtained by using the JPEG algorithm to ...
Josep Domingo-Ferrer, Jordi Herrera-Joancomart&iac...
ECCC
2010
91views more  ECCC 2010»
13 years 6 months ago
Limits on the rate of locally testable affine-invariant codes
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
Eli Ben-Sasson, Madhu Sudan
ECCC
2007
96views more  ECCC 2007»
13 years 6 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky