ACE ENGINEERING ACADEMY

THE ORIGINAL ACE ENGINEERING ACADEMY

**(ON-LINE EDUCATION, OUTSOURCING HRD & GATE/IES)**

gateguru@gateguru.org

GATEGURU.ORG

HYDERABAD, TELANGANA 500076

ph: 914027174000

alt: 09052345550

gateguru

**THE ROO-POOH-TIGGER STUDIES**

(2008-2018)

FOR SALE

The Roo number representation which can represent an integer in the range 0..2^2^n in O(n^2) bits by lossless compression using variable length encoding and error control coding and its related practical algorithm for implementation the Roo Number System are offered to any respectable peaceful organisation on negotiable terms. Any person with a high school background can verify and accept the correctness of the Roo number representation in a few minutes times and understand and accept the algorithm in a few hours time!! The purchasers can rename the representation and algorithm in their names and patent them!!

**Poo**, or **Pooh**, also known as **Spuwa** (altitude 2,662 metres or 8,736 ft), is a small town in Kinnaur district, Himachal Pradesh, India.

The traditional arguments fanatically and vociferously advamced against lossless data compression algorithms not being possible for all strings are based on the use of the Pigeon Hole principle/counting arguments. These are totally valid but they have a flaw. They deal with dumb strings. A string is treated as a sequence of bits and nothing else.

Pooh and his friends show that lossless data compression is possible using smart strings. Given some input strings a bound N is placed on the length of the input string. Then the traditional semantics is that a string can be viewed as the Arabic Positional Representation of an integer in the range 0...(2^N-1). Pooh and his friends proceed further in the additon of semantics to dumb strings to make them smart strings. The first of all assume all the given input strings are of size N by using padding with 0's. Then they bloat up the input string and impose the semantics of variants of circular doubly linked lists or other data structures on the dumb string. When they bloat up the string they use error control coding techniques. Then they collapse the bloated string to a size of M bits using the properties of trees that the height of balanced trees may of polynomial length but the number of leaves will be exponential in number. M is much less than N. All input strings are reduced to the same size M. The compressed strings are smart strings. So to interpret the compressed string we must first use the semantics and bloat it up enormously so that the data structure stands out. Noise may result from the bloating but referees which are part of M remove the errors using the error control coding algorithm and we end up with the original uncompressed bloated string from which we recover the input string without any loss. Traditional studies of error control coding deal with the transmission of data over channels with random noise. Pooh and his friends avoid the Shannon Limit by using transmission with error control coding techniques over deterministic controlled channels in the bloating of the string. The net result is that we have in principle the logarithmic compression of a googol and by iterative use of the method a log log compression of a googoplex.see here.

THE ACTUAL ROO NUMBER SYSTEM OUTLINED

We want to transmit a packet of data of n bits from one node to another in a communication network. Assume no noise in the channel, if there is noise we use traditional techniques. We are interested in lossless unlimited compression. We bloat up this packet to a bit string of size bn^c, b and c some constants, using error control coding techniques over deterministic controlled channels where the Shannon limit does not apply. A use is made of the unary number representation. Use is made of generalised doubly linked lists. The bloated string is collapsed and condensed to a special graph of klog(n) nodes, for some constant k, to a refereed generalisation of the Hamiltonian cycle problem. This representation, along with some material for the referee, is called the Roo number of the integer represented by n being treated as its binary representation. The Roo number is expanded to a complete tree of height klog(n) with each interior node having klog(n) sons to a size (klog(n))^(klog(n))>bn^c leaves (for suitable choices of the constansts k, b and c). From this bloated representation the referee is used to recover n.

+++++

Rabbit has worked out by hand a simple, quick and dirty pictorial and graphical example of the Roo Number System in a couple of hours time!!

+++++

A rigorous treatment of why the exponential is effectively tackled by the Roo Number System can be explained by using Pascal's Triangle/**Yang Hui's triangle** (杨辉三角; 楊輝三角) .

++++

Doubly linked lists so fundamental to the Roo Number System can be looked up in the reference given below. The Roo Number System generalises these to Euclidean circular doubly linked lists.

*AN EPIC POEM OF THE LAST CENTURY*

+++++

++++

+++

++

+

** **

**AN IMAGINARY BOTTLENECK **

The Roo-Number-System says that the so-called bottleneck in the transmission of large data is just some sadistic masochism by all of us. We can use lossless compression to transmit the entire data stored on the internet in a 'jiffy' using lossless data compression!

**ARE WE ALL TAKING OURSELVES FOR A RIDE?**

Still have questions?

Please contact us anytime! We look forward to hearing from you.

GATEGURU.ORG

HYDERABAD, TELANGANA 500076

ph: 914027174000

alt: 09052345550

gateguru