Sciweavers

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

11

ITA
2006

favoriteEmaildiscussreport

100views Communications» more ITA 2006»

Sequences of low arithmetical complexity

13 years 4 months ago

Sequences of low arithmetical complexity

Download www.math.nsc.ru

Arithmetical complexity of a sequence is the number of words of length n that can be extracted from it according to arithmetic progressions. We study uniformly recurrent words of low arithmetical complexity and describe the family of such words having lowest complexity. Mathematics Subject Classification. 68R15.

Sergey V. Avgustinovich, Julien Cassaigne, Anna E.

Real-time Traffic

Arithmetic Progressions | Arithmetical Complexity | Communications | ITA 2006 | Low Arithmetical Complexity |

claim paper

Related Content

» PermutationBased LowComplexity Alternate Coding in MultiView H264AVC

» Low and Ultra LowPower Arithmetic Units Design and Comparison

» Near optimal training sequences for low complexity symbol timing estimation in MIMO system...

» Combinatorial Complexity of Convex Sequences

» The Arithmetical Complexity of Dimension and Randomness

» A LowComplexity HighPerformance Preprocessing Algorithm for Multiuser Detection Using Gold...

» LowComplexity Compression of Short Messages

» LowComplexity Scalable DCT Image Compression

» The trace of an optimal normal element and low complexity normal bases

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	ITA
Authors	Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid

Comments (0)