Sciweavers

1060 search results - page 51 / 212
» Notes on Coding Theory
Sort
View
AOSD
2010
ACM
15 years 4 months ago
A theory of distributed aspects
Over the last five years, several systems have been proposed to take distribution into account in Aspect-Oriented Programming. While they appeared to be fruitful to develop or im...
Nicolas Tabareau
ISSS
2002
IEEE
154views Hardware» more  ISSS 2002»
15 years 2 months ago
Optimal Code Size Reduction for Software-Pipelined and Unfolded Loops
Software pipelining and unfolding are commonly used techniques to increase parallelism for DSP applications. However, these techniques expand the code size of the application sign...
Bin Xiao, Zili Shao, Chantana Chantrapornchai, Edw...
CORR
2007
Springer
110views Education» more  CORR 2007»
14 years 9 months ago
On formulas for decoding binary cyclic codes
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
Daniel Augot, Magali Bardet, Jean-Charles Faug&egr...
IH
2007
Springer
15 years 3 months ago
YASS: Yet Another Steganographic Scheme That Resists Blind Steganalysis
Abstract. A new, simple, approach for active steganography is proposed in this paper that can successfully resist recent blind steganalysis methods, in addition to surviving distor...
Kaushal Solanki, Anindya Sarkar, B. S. Manjunath
CORR
2004
Springer
111views Education» more  CORR 2004»
14 years 9 months ago
Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
Venkatesan Guruswami, Alexander Vardy