Sciweavers

140 search results - page 2 / 28
» Some new results for optimal ternary linear codes
Sort
View
COMBINATORICS
2007
59views more  COMBINATORICS 2007»
13 years 7 months ago
New Optimal Constant Weight Codes
In 2006, Smith et al. published a new table of constant weight codes, updating existing tables originally created by Brouwer et al. This paper improves upon these results by fill...
Igor Gashkov, D. Taub
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
13 years 8 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
IMA
1999
Springer
69views Cryptology» more  IMA 1999»
13 years 11 months ago
Some Applications of Bounds for Designs to the Cryptography
Recent years have seen numerous examples when designs play an important role in the study of such topics in cryptography as secrecy and authentication codes, secret sharing scheme...
Svetla Nikova, Ventzislav Nikov
MMSEC
2006
ACM
148views Multimedia» more  MMSEC 2006»
14 years 1 months ago
Minimizing the embedding impact in steganography
In this paper, we study the trade-off in steganography between the number of embedding changes and their amplitude. We assume that each element of the cover image is assigned a sc...
Jessica J. Fridrich
ICVS
2001
Springer
13 years 11 months ago
Compiling SA-C Programs to FPGAs: Performance Results
Abstract. At the first ICVS, we presented SA-C (“sassy”), a singleassignment variant of the C programming language designed to exploit both coarse-grain and fine-grain parallel...
Bruce A. Draper, A. P. Wim Böhm, Jeffrey Hamm...