1579 search results - page 160 / 316 » On the Constructions of Constant-Weight Codes |
144
click to vote
ISSAC
2007
Springer
16 years 17 days ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
179
click to vote
OOPSLA
2007
Springer
16 years 16 days ago
2007
Springer
Schematic tables are a new representation for conditionals. Roughly a cross between decision tables and data flow graphs, they represent computation and decision-making orthogona...
167
click to vote
PADL
2007
Springer
16 years 16 days ago
2007
Springer
Writing code that manipulates bit streams is a painful and error-prone programming task, often performed via bit twiddling techniques such as explicit bit shifts and bit masks in p...
162
click to vote
CCS
2004
ACM
15 years 11 months ago
2004
ACM
We show that a number of recent definitions and constructions of fuzzy extractors are not adequate for multiple uses of the same fuzzy secret—a major shortcoming in the case of...
153
click to vote
IFL
2003
Springer
15 years 11 months ago
2003
Springer
Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, na¨ıve compilation of suc...