Sciweavers

1579 search results - page 112 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
CPC
2004
69views more  CPC 2004»
14 years 9 months ago
New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
Let C be a code of length n over an alphabet of q letters. A codeword y is called a descendant of a set of t codewords {x1 , . . . , xt } if yi {x1 i , . . . , xt i} for all i = ...
Noga Alon, Uri Stav
CADE
2003
Springer
15 years 10 months ago
Foundational Certified Code in a Metalogical Framework
Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the s...
Karl Crary, Susmit Sarkar
PLDI
2006
ACM
15 years 3 months ago
Termination proofs for systems code
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...
Byron Cook, Andreas Podelski, Andrey Rybalchenko
CHI
2007
ACM
15 years 1 months ago
Aligning development tools with the way programmers think about code changes
Software developers must modify their programs to keep up with changing requirements and designs. Often, a conceptually simple change can require numerous edits that are similar b...
Marat Boshernitsan, Susan L. Graham, Marti A. Hear...
GLOBECOM
2009
IEEE
15 years 1 months ago
R-Code: Network Coding Based Reliable Broadcast in Wireless Mesh Networks with Unreliable Links
Broadcast is an important primitive in wireless mesh networks (WMNs). Applications like network-wide software update require reliable reception of the content with low-latency and ...
Zhenyu Yang, Ming Li, Wenjing Lou