1953 search results - page 103 / 391 » codes 2010 |
125
click to vote
MM
2010
ACM
15 years 4 months ago
2010
ACM
It has been theoretically shown that performing coding in networked systems, including Reed-Solomon codes, fountain codes, and random network coding, has a clear advantage with re...
147
click to vote
TCOM
2010
15 years 2 months ago
2010
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
165
click to vote
WCRE
2010
IEEE
15 years 2 months ago
2010
IEEE
— The paper presents an approach that combines conceptual and evolutionary techniques to support change impact analysis in source code. Information Retrieval (IR) is used to deri...
155
click to vote
ECCC
2006
15 years 4 months ago
2006
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
142
click to vote
ENTCS
2002
15 years 4 months ago
2002
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...