Short Wins Long: Short Codes with Language Model Semantic Correction Outperform Long Codes

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Hao, Jiafu, Yue, Chentao, Chang, Hao, Vucetic, Branka, Li, Yonghui
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908362935894016
author Hao, Jiafu
Yue, Chentao
Chang, Hao
Vucetic, Branka
Li, Yonghui
author_facet Hao, Jiafu
Yue, Chentao
Chang, Hao
Vucetic, Branka
Li, Yonghui
contents This paper presents a novel semantic-enhanced decoding scheme for transmitting natural language sentences with multiple short block codes over noisy wireless channels. After ASCII source coding, the natural language sentence message is divided into segments, where each is encoded with short block channel codes independently before transmission. At the receiver, each short block of codewords is decoded in parallel, followed by a semantic error correction (SEC) model to reconstruct corrupted segments semantically. We design and train the SEC model based on Bidirectional and Auto-Regressive Transformers (BART). Simulations demonstrate that the proposed scheme can significantly outperform encoding the sentence with one conventional long LDPC code, in terms of block error rate (BLER), semantic metrics, and decoding latency. Finally, we proposed a semantic hybrid automatic repeat request (HARQ) scheme to further enhance the error performance, which selectively requests retransmission depends on semantic uncertainty.
format Preprint
id arxiv_https___arxiv_org_abs_2505_08536
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Short Wins Long: Short Codes with Language Model Semantic Correction Outperform Long Codes
Hao, Jiafu
Yue, Chentao
Chang, Hao
Vucetic, Branka
Li, Yonghui
Signal Processing
Information Theory
This paper presents a novel semantic-enhanced decoding scheme for transmitting natural language sentences with multiple short block codes over noisy wireless channels. After ASCII source coding, the natural language sentence message is divided into segments, where each is encoded with short block channel codes independently before transmission. At the receiver, each short block of codewords is decoded in parallel, followed by a semantic error correction (SEC) model to reconstruct corrupted segments semantically. We design and train the SEC model based on Bidirectional and Auto-Regressive Transformers (BART). Simulations demonstrate that the proposed scheme can significantly outperform encoding the sentence with one conventional long LDPC code, in terms of block error rate (BLER), semantic metrics, and decoding latency. Finally, we proposed a semantic hybrid automatic repeat request (HARQ) scheme to further enhance the error performance, which selectively requests retransmission depends on semantic uncertainty.
title Short Wins Long: Short Codes with Language Model Semantic Correction Outperform Long Codes
topic Signal Processing
Information Theory
url https://arxiv.org/abs/2505.08536