Sciweavers

1060 search results - page 156 / 212
» Notes on Coding Theory
Sort
View
DCC
2010
IEEE
14 years 9 months ago
On multiple caps in finite projective spaces
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the size of such caps. Furthermore, we generalize two product constructions for (k,...
Yves Edel, Ivan N. Landjev
CORR
2006
Springer
98views Education» more  CORR 2006»
14 years 9 months ago
A field-theory motivated approach to symbolic computer algebra
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
Kasper Peeters
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...
LISP
2008
101views more  LISP 2008»
14 years 9 months ago
Flow-sensitive type systems and the ambient calculus
The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code. Numerous analyses have been developed for numerous va...
Torben Amtoft
ENTCS
2007
102views more  ENTCS 2007»
14 years 9 months ago
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
Brigitte Pientka