Use the Code

Encode the Pinned Message

The message is rewritten by replacing each symbol with its code.

highlighted = computed this step

Rewrite each symbol

The pinned message is ABACAD. The encoder replaces each symbol with its code.

message is ABACAD\text{message is ABACAD}
Encode the pinned messageHuffman rows recomputed from pinned counts and message.Encode the pinned message - 12 fixed bits, 11 Huffman bitsrowvaluecheckcount A5pinned countcount B2pinned countcount C1pinned countcount D1pinned countmerge 1C(1)+D(1)=CD(2)lowest count, then lexicalmerge 2B(2)+CD(2)=BCD(4)lowest count, then lexicalmerge 3BCD(4)+A(5)=root(9)lowest count, then lexicalcode A1left 0, right 1code B00left 0, right 1code C010left 0, right 1code D011left 0, right 1messageABACADpinned messagefixed bits122 bits per symbolhuffman bits11sum code lengthsencoded10010101011message rewritten with codes

Follow the message order

ABACAD becomes A, B, A, C, A, D, so the code pieces are 1, 00, 1, 010, 1, 011.

A,B,A,C,A,DA,B,A,C,A,D
Encode the pinned messageHuffman rows recomputed from pinned counts and message.Encode the pinned message - 12 fixed bits, 11 Huffman bitsrowvaluecheckcount A5pinned countcount B2pinned countcount C1pinned countcount D1pinned countmerge 1C(1)+D(1)=CD(2)lowest count, then lexicalmerge 2B(2)+CD(2)=BCD(4)lowest count, then lexicalmerge 3BCD(4)+A(5)=root(9)lowest count, then lexicalcode A1left 0, right 1code B00left 0, right 1code C010left 0, right 1code D011left 0, right 1messageABACADpinned messagefixed bits122 bits per symbolhuffman bits11sum code lengthsencoded10010101011message rewritten with codes

Join the pieces

Joining those pieces gives encoded bitstring 10010101011.

encoded=10010101011\text{encoded}=10010101011
Encode the pinned messageHuffman rows recomputed from pinned counts and message.Encode the pinned message - 12 fixed bits, 11 Huffman bitsrowvaluecheckcount A5pinned countcount B2pinned countcount C1pinned countcount D1pinned countmerge 1C(1)+D(1)=CD(2)lowest count, then lexicalmerge 2B(2)+CD(2)=BCD(4)lowest count, then lexicalmerge 3BCD(4)+A(5)=root(9)lowest count, then lexicalcode A1left 0, right 1code B00left 0, right 1code C010left 0, right 1code D011left 0, right 1messageABACADpinned messagefixed bits122 bits per symbolhuffman bits11sum code lengthsencoded10010101011message rewritten with codes

Summary

The encoded string is recomputed from the counts, the deterministic merge rule, and message ABACAD.

encoded=10010101011\text{encoded}=10010101011
Encode the pinned messageHuffman rows recomputed from pinned counts and message.Encode the pinned message - 12 fixed bits, 11 Huffman bitsrowvaluecheckcount A5pinned countcount B2pinned countcount C1pinned countcount D1pinned countmerge 1C(1)+D(1)=CD(2)lowest count, then lexicalmerge 2B(2)+CD(2)=BCD(4)lowest count, then lexicalmerge 3BCD(4)+A(5)=root(9)lowest count, then lexicalcode A1left 0, right 1code B00left 0, right 1code C010left 0, right 1code D011left 0, right 1messageABACADpinned messagefixed bits122 bits per symbolhuffman bits11sum code lengthsencoded10010101011message rewritten with codes