Sciweavers

1579 search results - page 26 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
CODCRY
2009
Springer
174views Cryptology» more  CODCRY 2009»
15 years 4 months ago
Equal-Weight Fingerprinting Codes
We consider binary fingerprinting codes that trace at least one of t pirates using the marking assumption. Ensembles of binary equal-weight codes are considered along with a new e...
Ilya Dumer
SIAMCOMP
2008
130views more  SIAMCOMP 2008»
14 years 9 months ago
Short PCPs with Polylog Query Complexity
We give constructions of probabilistically checkable proofs (PCPs) of length n
Eli Ben-Sasson, Madhu Sudan
STOC
2012
ACM
185views Algorithms» more  STOC 2012»
13 years 3 days ago
Subspace evasive sets
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
Zeev Dvir, Shachar Lovett
FPLE
1995
15 years 1 months ago
Compiler Construction Using Scheme
This paper describes a course in compiler design that focuses on the Scheme implementation of a Scheme compiler that generates native assembly code for a real architecture. The co...
Eric Hilsdale, J. Michael Ashley, R. Kent Dybvig, ...
80
Voted
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
14 years 11 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra