Sciweavers

1579 search results - page 42 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
RSA
2006
74views more  RSA 2006»
14 years 9 months ago
Robust locally testable codes and products of codes
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
Eli Ben-Sasson, Madhu Sudan
DCC
2009
IEEE
15 years 10 months ago
Linear Suffix Array Construction by Almost Pure Induced-Sorting
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
Ge Nong, Sen Zhang, Wai Hong Chan
WSC
1996
14 years 11 months ago
Scalable simulation models for construction operations
Construction operations are often repetitive not only in terms of time (the same tasks are performed over and over) but also in terms of space (the same tasks are repeated at seve...
Photios G. Ioannou, Julio C. Martínez
JACM
2006
112views more  JACM 2006»
14 years 9 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...
COCO
2007
Springer
96views Algorithms» more  COCO 2007»
15 years 3 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. ...