Sciweavers

1579 search results - page 109 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
AI
2003
Springer
15 years 3 months ago
Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
Dan C. Tulpan, Holger H. Hoos
FOCS
2002
IEEE
15 years 2 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
AADEBUG
1997
Springer
15 years 2 months ago
Debugging Optimised Code Using Function Interpretation
Previously the debugging of optimised code has not been possible without recompiling the executable code and preventing the use of code optimisation techniques. Although current r...
Kim Elms
TDSC
2008
99views more  TDSC 2008»
14 years 9 months ago
Integrity Codes: Message Integrity Protection and Authentication over Insecure Channels
Inspired by unidirectional error detecting codes that are used in situations where only one kind of bit error is possible (e.g., it is possible to change a bit "0" into a...
Srdjan Capkun, Mario Cagalj, Ram Kumar Rengaswamy,...
ICSM
2009
IEEE
14 years 7 months ago
Co-evolution of source code and the build system
A build system breathes life into source code, as it configures and directs the construction of a software system from textual source code modules. Surprisingly, build languages a...
Bram Adams