Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

3

JCT
2000

favoriteEmaildiscussreport

51views more JCT 2000»

An Upper Bound for B2[2] Sequences

13 years 4 months ago

An Upper Bound for B2[2] Sequences

Download www.uam.es

Abstract. We introduce a new counting method to deal with B2[2] sequences, getting a new upper bound for the size of these sequences, F(N, 2)

Javier Cilleruelo

Real-time Traffic

JCT 2000 |

claim paper

Related Content

» RNA Folding Including Pseudoknots A New Parameterized Algorithm and Improved Upper Bound

» Upper Bounding Fault Coverage by Structural Analysis and Signal Monitoring

» Sequence Design for SymbolAsynchronous CDMA with Power or Rate Constraints

» MultiplyRecursive Upper Bounds with Higmans Lemma

» Bounds on the Minimum Mosaic of Population Sequences under Recombination

» Exploiting a pagelevel upper bound for multitype nearest neighbor queries

» Statistical properties of the error covariance in a Kalman filter with random measurement ...

» Intrinsic Complexity of Learning Geometrical Concepts from Positive Data

» Improved Upper Bound for the Redundancy of FixFree Codes

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	JCT
Authors	Javier Cilleruelo

Comments (0)