Sciweavers

215 search results - page 23 / 43
» The asymptotic number of binary codes and binary matroids
Sort
View
IMA
2001
Springer
134views Cryptology» more  IMA 2001»
15 years 4 months ago
Almost-Certainly Runlength-Limiting Codes
Standard runlength-limiting codes – nonlinear codes defined by trellises – have the disadvantage that they disconnect the outer errorcorrecting code from the bit-by-bit likeli...
David J. C. MacKay
IPL
2011
96views more  IPL 2011»
14 years 6 months ago
Restricted compositions and permutations: From old to new Gray codes
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
Vincent Vajnovszki, Rémi Vernay
ICISC
2008
103views Cryptology» more  ICISC 2008»
15 years 1 months ago
Instruction Set Limitation in Support of Software Diversity
This paper proposes a novel technique, called instruction set limitation, to strengthen the resilience of software diversification against collusion attacks. Such attacks require a...
Bjorn De Sutter, Bertrand Anckaert, Jens Geiregat,...
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
15 years 5 months ago
Efficient Processing of Updates in Dynamic XML Data
It is important to process the updates when nodes are inserted into or deleted from the XML tree. All the existing labeling schemes have high update cost, thus in this paper we pr...
Changqing Li, Tok Wang Ling, Min Hu
BMCBI
2011
14 years 6 months ago
Analysis on the reconstruction accuracy of the Fitch method for inferring ancestral states
Background: As one of the most widely used parsimony methods for ancestral reconstruction, the Fitch method minimizes the total number of hypothetical substitutions along all bran...
Jialiang Yang, Jun Li, Liuhuan Dong, Stefan Gr&uum...