Sciweavers

3373 search results - page 274 / 675
» Linear transformations on codes
Sort
View
GECCO
1999
Springer
142views Optimization» more  GECCO 1999»
15 years 8 months ago
Towards Byte Code Genetic Programming
This paper uses the GP paradigm to evolve linear genotypes (individuals) that consist of Java byte code. Our prototype GP system is implemented in Java using a standard Java devel...
Brad Harvey, James A. Foster, Deborah A. Frincke
ENTCS
2007
85views more  ENTCS 2007»
15 years 4 months ago
Stochastic Modelling of Communication Protocols from Source Code
A major development in qualitative model checking was the jump to verifying properties of source code directly, rather than requiring a separately specified model. We describe an...
Michael J. A. Smith
TIT
1998
123views more  TIT 1998»
15 years 4 months ago
The Minimum Description Length Principle in Coding and Modeling
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
Andrew R. Barron, Jorma Rissanen, Bin Yu
TCOM
2010
142views more  TCOM 2010»
14 years 11 months ago
Performance Bounds and Distance Spectra of Variable Length Codes in Turbo/Concatenated Systems
Abstract--Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in the presence of noisy channels. Addressing this problem with joint sour...
Xavier Jaspar, Luc Vandendorpe
176
Voted
STOC
2012
ACM
201views Algorithms» more  STOC 2012»
13 years 7 months ago
From irreducible representations to locally decodable codes
Locally Decodable Code (LDC) is a code that encodes a message in a way that one can decode any particular symbol of the message by reading only a constant number of locations, eve...
Klim Efremenko