BINARY CODING: A binary code is a way of representing text or computer processor instructions by the use of the binary number

system's two-binary digits 0 and 1. This is accomplished by assigning a bit string to each particular symbol or instruction. For example, a binary string of eight binary digits (bits) can represent any of 256 possible values and can therefore correspond to a variety of different symbols, letters or instructions. In computing and telecommunication, binary codes are used for any of a variety of methods of encoding data, such as character strings, into bit strings. Those methods may be fixed-width or variable-width. In a fixedwidth binary code, each letter, digit, or other character, is represented by a bit string of the same length; that bit string, interpreted as a binary number, is usually displayed in code tables in octal, decimal or hexadecimal notation. There are many character sets and many character encodings for them. A bit string, interpreted as a binary number, can be translated into a decimal number. For example, the lowercase "a" as represented by the bit string 01100001, can also be represented as the decimal number 97. HISTORY OF BINARY CODING: Binary numbers were first described in Chandashutram written by Pingala in 100 BC. PINGALA: Pingala. Another question inspired by the study of rhythm is: how many patterns canbe formed from a given number of syllables? For example, how many patterns consist ofthree syllables? The syllables can be all L's, all S's, or some mixture of L's and S's. The answer is eight; see if you can discover how I grouped them. SSS SSL SLL LLL SLS LSL LLS LSS Pingala's Chandahsutra (c. 200 B.C.) enumerated the possible poetic meters of a fixed number of syllables. Syllables are short (1 beat) or long(2beats). He classified 16 different meters of four syllables in the following way:

1 meter of four short syllables 4 meters of three shorts and a long 6 meters of two shorts and two longs 4 meters of one short and three longs 1 meter of four longs Now find the number of patterns consisting of two syllables, grouped by length: Let's make a chart of the results and look for a pattern: Number of Syllables: 1 2 3 4 5 6 Number ofpatterns Grouping of patterns

4 8 16

1+3+3+1 1 + 5 + 10 + 10 + 5 + 1 1 + 6 + 15 + 20 + 15 + 6 + 1

Since Sanskrit metres are based on the s ys tem of

s hort, laghu,and l ong, guru , syllables, represented traditionally by| and S (by us as 1 and 0), the s utra may be written as:1000101110 which represents the sequences100, 000, 001, 010, 101, 011, 111, 110 .Since the last two bits are the same as the rst two, the 10-bit sequence may be written as a wheel of 8-bits, which describes all the 8 dierent subsequences of length 3.

The classication of metres is described most comprehensively rst in Chandah .s astra ( C S ) b y P i ngala who has been assigned variously from the 5th century BC to the 2nd century AD. According to one tradition, Pingala wa s t h e yo u n g e r b r o t h e r o f P anini, the great grammarian a n d i f t h a t i s correct then he should be assigned to about the 5th century BC. Metres are described in Agni Purana and in several technical texts written in the past 2,000 years, the most famous of which is the Vrttaratnakara of Kedara

.Pingalas representation for the 3-syllable verse-feet (CS, Adhya ya 1 ) i s given in Table 1. The rst bit, 1 or 0, of each verse-foot determines whether i t i s laghu or guru , respectively. Table 1.T h e P i ngala mapping m 0 0 0 1 0 0 r 0 1 0 s 1 1 0 t 0 0 1 j 1 0 1 b h 0 1 1 n 1 1 1 Note that the 8 sequences fall into two complementary subclasses when0s and 1s are interchanged. Thus m, y, r, s are in one group and t, j, bh, n are in another.T h e ma p p i n g o f Ta b l e 1 r e p r e s e n t s a b i n a r y n u m b e r c o d i n g o f t h e 3 - s yl l a b l e s e xc e p t i n g t h a t t h e o r d e r o f t h e b i t s i s r e ve r s e d f r o m o u r mo d e r n representation, so the bit on the left is the least signicant and the one onthe right is the most signicant. We also note, parenthetically, that rathert h a n rank the sequences from 0 to 2 n 1 , t h e y we r e r a n k e d f r o m 1 t o 2 n ,b u t t h i s wa s d o n e b y a d d i n g 1 t o t h e c o mp u t e d n u me r i c a l va l u e f o r e a c h y