In-Context Source and Channel Coding

• URL: http://arxiv.org/abs/2601.10267v1
• Date: Thu, 15 Jan 2026 10:37:57 GMT
• Title: In-Context Source and Channel Coding
• Authors: Ziqiong Wang, Tianqi Ren, Rongpeng Li, Zhifeng Zhao, Honggang Zhang,
• Abstract summary: This paper proposes a receiver-side In-Context Decoding (ICD) framework that enhances SSCC robustness without modifying the transmitter.<n>ICD constructs a confidence-ranked candidate pool via reliability-guided bit flipping, samples a compact yet diverse subset of candidates, and applies an LLM-based arithmetic decoder to obtain both reconstructions and sequence-level log-likelihoods.
• Score: 12.557918082908545
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Separate Source-Channel Coding (SSCC) remains attractive for text transmission due to its modularity and compatibility with mature entropy coders and powerful channel codes. However, SSCC often suffers from a pronounced cliff effect in low Signal-to-Noise Ratio (SNR) regimes, where residual bit errors after channel decoding can catastrophically break lossless source decoding, especially for Arithmetic Coding (AC) driven by Large Language Models (LLMs). This paper proposes a receiver-side In-Context Decoding (ICD) framework that enhances SSCC robustness without modifying the transmitter. ICD leverages an Error Correction Code Transformer (ECCT) to obtain bit-wise reliability for the decoded information bits. Based on the context-consistent bitstream, ICD constructs a confidence-ranked candidate pool via reliability-guided bit flipping, samples a compact yet diverse subset of candidates, and applies an LLM-based arithmetic decoder to obtain both reconstructions and sequence-level log-likelihoods. A reliability-likelihood fusion rule then selects the final output. We further provide theoretical guarantees on the stability and convergence of the proposed sampling procedure. Extensive experiments over Additive White Gaussian Noise (AWGN) and Rayleigh fading channels demonstrate consistent gains compared with conventional SSCC baselines and representative Joint Source-Channel Coding (JSCC) schemes.

Related papers

• Joint Source-Channel-Generation Coding: From Distortion-oriented Reconstruction to Semantic-consistent Generation [58.67925548779465]
  We propose Joint Source-Channel-Generation Coding (JSCGC), a novel paradigm that shifts the focus from perceptual reconstruction to probabilistic generation.<n>JSCGC improves substantially semantic quality and semantic fidelity, significantly outperforming conventional distortion-oriented J SCC methods.
  arXiv  Detail & Related papers  (2026-01-19T08:12:47Z)
• SecDiff: Diffusion-Aided Secure Deep Joint Source-Channel Coding Against Adversarial Attacks [73.41290017870097]
  SecDiff is a plug-and-play, diffusion-aided decoding framework.<n>It significantly enhances the security and robustness of deep J SCC under adversarial wireless environments.
  arXiv  Detail & Related papers  (2025-11-03T11:24:06Z)
• Channel-Aware Vector Quantization for Robust Semantic Communication on Discrete Channels [5.680520767606761]
  We propose a channel-aware vector quantization (CAVQ) algorithm within a joint source-channel coding framework, termed VQJSCC.<n>In this framework, semantic features are discretized and directly mapped to modulation constellation symbols, while CAVQ integrates channel transition probabilities into the quantization process.<n>A multi-codebook alignment mechanism is also introduced to handle mismatches between codebook order and modulation order by decomposing the transmission stream into subchannels.
  arXiv  Detail & Related papers  (2025-10-21T13:02:35Z)
• Adaptive Source-Channel Coding for Semantic Communications [48.13990936094994]
  Semantic communications (SemComs) have emerged as a promising paradigm for joint data and task-oriented transmissions.<n>Current joint source-channel coding (JSCC) in SemComs is not compatible with the existing communication systems.<n>We propose an adaptive source-channel coding scheme for SemComs over parallel Gaussian channels.
  arXiv  Detail & Related papers  (2025-08-11T13:09:54Z)
• SING: Semantic Image Communications using Null-Space and INN-Guided Diffusion Models [52.40011613324083]
  Joint source-channel coding systems (DeepJSCC) have recently demonstrated remarkable performance in wireless image transmission.<n>Existing methods focus on minimizing distortion between the transmitted image and the reconstructed version at the receiver, often overlooking perceptual quality.<n>We propose SING, a novel framework that formulates the recovery of high-quality images from corrupted reconstructions as an inverse problem.
  arXiv  Detail & Related papers  (2025-03-16T12:32:11Z)
• Decoding for Punctured Convolutional and Turbo Codes: A Deep Learning Solution for Protocols Compliance [32.887114329215045]
  This paper proposes a unified long short-term memory (LSTM)-based neural decoder for punctured convolutional and Turbo codes.<n>The key component of the proposed LSTM-based neural decoder is puncturing-aware embedding, which integrates puncturing patterns directly into the neural network.
  arXiv  Detail & Related papers  (2025-02-21T14:00:14Z)
• Rateless Joint Source-Channel Coding, and a Blueprint for 6G Semantic Communications System Design [4.2240468630800985]
  This paper introduces rateless joint source-channel coding (rateless J SCC)<n>We also introduce rate-adaptive and stable communication link operation to accommodate rateless J SCCs.<n>In the second part of the paper, we dive into the practical concerns around semantic communication and provide a blueprint for semantic networking system design.
  arXiv  Detail & Related papers  (2025-02-10T01:49:16Z)
• Threshold Selection for Iterative Decoding of $(v,w)$-regular Binary Codes [84.0257274213152]
  Iterative bit flipping decoders are an efficient choice for sparse $(v,w)$-regular codes.<n>We propose concrete criteria for threshold determination, backed by a closed form model.
  arXiv  Detail & Related papers  (2025-01-23T17:38:22Z)
• Rateless Stochastic Coding for Delay-Constrained Semantic Communication [5.882972817816777]
  We consider the problem of joint source-channel coding for semantic communication from a rateless perspective.<n>We propose a more general communication objective that minimizes the perceptual distance by incorporating a semantic-level reconstruction objective.<n>We show that the proposed rateless distortion coding scheme can achieve variable rates of transmission maintaining an excellent trade-off between distortion and perception.
  arXiv  Detail & Related papers  (2024-06-28T10:27:06Z)
• Deep Joint Source-Channel Coding with Iterative Source Error Correction [11.41076729592696]
  We propose an iterative source error correction (ISEC) decoding scheme for deep-learning-based joint source-channel code (Deep J SCC) Given a noisyword received through the channel, we use a Deep J SCC encoder and decoder pair to update the code iteratively. The proposed scheme produces more reliable source reconstruction results compared to the baseline when the channel noise characteristics do not match the ones used during training.
  arXiv  Detail & Related papers  (2023-02-17T22:50:58Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Denoising Diffusion Error Correction Codes [92.10654749898927]
  Recently, neural decoders have demonstrated their advantage over classical decoding techniques. Recent state-of-the-art neural decoders suffer from high complexity and lack the important iterative scheme characteristic of many legacy decoders. We propose to employ denoising diffusion models for the soft decoding of linear codes at arbitrary block lengths.
  arXiv  Detail & Related papers  (2022-09-16T11:00:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.