Recursive indexing: Difference between revisions

Revision as of 00:41, 15 May 2014

Latest revision as of 15:40, 16 October 2023

(7 intermediate revisions by 7 users not shown)

Line 1:

{{no footnotes|date=June 2020}}

{{multiple issues|

{{Orphan|date=November 2006|att=March 2014}}

{{Context|date=March 2014}}

}}

'''Recursive indexing''' is an [[algorithm]] used to represent large numeric values using members of a relatively small [[Set (mathematics)|set]].

When number (generally large number) is represented in a finite alphabet set, and it cannot be represented by just one member of the set, '''Recursive indexing''' is used.

Recursive indexing itself is a method to writewrites the successive differences of the number after extracting the maximum value of the alphabet set from the number, and continuing recursively till the difference falls in the range of the set.

Recursive indexing with a 2-letter alphabet is called [[unary code]].

Line 14 ⟶ 11:

range [0 – ''S''_max).

=== Example ===

Let ''S'' = [0 1 2 3 4 … 10], be an 11-element set, and we have to recursively index the value N=49.

According to this method, we need to keep removingsubtract 10 from 49, and keepiterate proceedinguntil tillthe wedifference reachis a number in the 0–10 range.

So theThe values are 10 (''N'' = 49 – 10 = 39), 10 (''N'' = 39 – 10 = 29), 10 (''N'' = 29 – 10 = 19), 10 (''N'' = 19 – 10 = 9), 9. The recursively indexed sequence for ''N'' = 49 with set ''S'', is 10, 10, 10, 10, 9.

Hence the recursively indexed sequence for ''N'' = 49 with set ''S'', is 10, 10, 10, 10, 9.

==Decoding==

Compute the sum of the index values.

Keep adding all the elements of the index, stopping when the index value is between (inclusive of ends) the least and penultimate elements of the set ''S''.

=== Example ===

ContinuingDecoding fromthe above example weinvolves have 10 + 10 + 10 + 10 + 9 = 49.

==Uses==

Line 32 ⟶ 28:

==References==

* Khalid Sayood, Introduction to Data Compression 3rd ed, [[Morgan Kaufmann]].

[[Category:Coding theory]]