# Semantic Huffman Coding using Synonymous Mapping

Source: [Semantic Huffman Coding using Synonymous Mapping](<https://www.sota2.com/research/paper/68fa5b531e209131ce9c7501>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T16:59:33.794Z

Authors: Jin Xu, Kai Niu, Zijian Liang, Ping Zhang

Published: 2024-01-26T03:54:31.000Z

## Abstract

Semantic communication stands out as a highly promising avenue for future developments in communications. Theoretically, source compression coding based on semantics can achieve lower rates than Shannon entropy. This paper introduces a semantic Huffman coding built upon semantic information theory. By incorporating synonymous mapping and synonymous sets, semantic Huffman coding can achieve shorter average code lengths. Furthermore, we demonstrate that semantic Huffman coding theoretically have the capability to approximate semantic entropy. Experimental results indicate that, under the condition of semantic lossless, semantic Huffman coding exhibits clear advantages in compression efficiency over classical Huffman coding.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2401.14634>)

[PDF](<https://arxiv.org/pdf/2401.14634.pdf>)
