Unary coding: Difference between revisions

Revision as of 00:34, 16 July 2022

Revision as of 00:48, 16 July 2022

Line 163:

| 9 || 000000001

|111111110

|- style="color: red;"

|-

| 10 || 0000000000

|1111111111

|-

| colspan="23" |

|

|}

Canonical codes can [http://www.cs.ucf.edu/courses/cap5015/Huff.pdf require less processing time to decode] when they are processed as numbers not a string. If the number of codes required per symbol length is different to 1, ie there are more non-unary codes of some length required, those would be achieved by increasing/decreasing the values numerically without reducing the length in that case.

==Generalized unary coding==