Sciweavers

345 search results - page 15 / 69
» A construction of a space-time code based on number theory
Sort
View
DCC
2008
IEEE
14 years 7 months ago
Coprimitive sets and inextendable codes
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
T. L. Alderson, Aiden A. Bruen
LFCS
2009
Springer
14 years 2 months ago
The Logic of Proofs as a Foundation for Certifying Mobile Computation
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...
Eduardo Bonelli, Federico Feller
TIT
2002
126views more  TIT 2002»
13 years 7 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
SPAA
2010
ACM
13 years 7 months ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
COCO
2007
Springer
96views Algorithms» more  COCO 2007»
14 years 1 months ago
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
Venkatesan Guruswami, Christopher Umans, Salil P. ...