Sciweavers

893 search results - page 45 / 179
» Descent Theory for Schemes
Sort
View
TIT
2002
126views more  TIT 2002»
14 years 11 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
15 years 5 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
TSP
2008
111views more  TSP 2008»
14 years 11 months ago
Coding Schemes for User Cooperation in Low-Power Regimes
We consider the design of cooperation coding schemes for a two-user multi-access channel (MAC). In particular, we consider two block Markov coding schemes, namely, the multiplexed...
Guosen Yue, Xiaodong Wang, Zigui Yang, Anders H&os...
POPL
2008
ACM
16 years 4 days ago
The design and implementation of typed scheme
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
Sam Tobin-Hochstadt, Matthias Felleisen
LICS
2006
IEEE
15 years 5 months ago
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
C.-H. Luke Ong