Papers for

telecommunications engineers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Hybrid monitoring detects subtle network faults in 5G systems

Hybrid Monitoring for Early Fault Detection in Cloud-Native 5G Systems

Abstract: This paper presents the design implementation and evaluation of NetMon a hybrid network monitoring system designed for Kubernetes-based 5G packet core deployments specifically evaluated on Ericssons Access and Mobility Management Function AMF clusters NetMon combines eBPF-based passive kernel-level traffic observation with active TCP probing and centralized correlation to detect and localize network degradation within seconds The evaluation results demonstrate that the system detects faults as subtle as 10ms of added latency or 5 packet loss correctly attributes them to the affected infrastructure component and maintains this capability under application loads up to 50 simulated UE load The total resource overhead of 34 millicores CPU and 45 MiB memory per pod suggests that the approach is promising for further validation without impacting the monitored workload The hybrid approach addresses a gap in existing monitoring tools standard health checks cannot detect partial degradation scrape-based systems introduce detection delays measured in tens of seconds and purely passive tools cannot verify idle network paths By combining these complementary techniques and centralizing the analysis the system provides the early detection and fault localization capabilities required for maintaining service quality in cloud-native 5G infrastructure.

Fri 11 SeptNetworking and Internet ArchitectureDistributed, Parallel, and Cluster Computing
The gist
Detecting small network problems early in 5G systems is hard but important to keep connections fast and reliable. The authors created NetMon, a tool that watches network traffic in different ways at once to catch tiny delays or lost packets within seconds. It tests parts of the system actively while also observing passively, then combines these views to find exactly where the problem is. Their tests showed NetMon works well without slowing down real users or requiring much extra computing power. This approach fills gaps left by other monitoring tools and helps maintain good service quality in cloud-based 5G networks.
Open 2609.12649v1

Speech enhancement improves with one-step dual latent drifting approach

DriftSE: Speech Enhancement with Generative Drifting

Abstract: We propose DriftSE, a novel one-step generative framework for speech enhancement formulated as a latent distribution equilibrium problem. During training, the drifting field aligns the generator's pushforward distribution with the clean speech manifold through drifting in a latent domain. During inference, the drifting process is discarded, enabling one-step generation. We establish that its enhancement quality depends fundamentally on the choice of latent representation. Semantic latents preserve phonetic structure but fail to capture physical acoustic cues, whereas acoustic latents reconstruct the physical signal but risk linguistic hallucination. Therefore, we introduce dual-latent drifting, performing parallel drifting in both semantic and acoustic latents to simultaneously preserve phonetic intelligibility and acoustic fidelity. Additionally, we demonstrate that DriftSE enables fully unpaired training by aligning latent distributions rather than exact point-wise targets. Consequently, DriftSE facilitates cross-dataset learning in the absence of paired noisy-clean samples. Moreover, DriftSE exhibits broad architectural flexibility across different generator backbones. Extensive evaluations on additive denoising and convolutive dereverberation demonstrate robust one-step enhancement across both offline and real-time causal settings. Notably, DriftSE achieves state-of-the-art word error rates across all four evaluated datasets while strictly operating at 1 NFE. Code and audio examples are available online.

Thu 10 SeptSoundArtificial Intelligence
The gist
Cleaning up noisy speech recordings is important for clearer communication and better voice recognition. The authors created a method called DriftSE that improves speech clarity in just one step by using two kinds of hidden information about sounds: one that focuses on meaning and one that focuses on the actual physical sound details. This approach works well even without examples of noisy and clean speech pairs during training and can be used in real-time applications. Tests show that DriftSE leads to better word recognition accuracy than previous methods.
Open 2609.12252v1

AI detects hidden malicious commands in 6G network setups

On Identifying Adversarial Intent Injection in AI-Native 6G Networks

Abstract: AI-native 6G networks have brought Intent-Based Networking (IBN) to the forefront, enabling high-level goals to be translated into network configurations. However, this abstraction opens new attack surfaces, primarily adversarial intent injection, where malicious policies are disguised within benign intent flows. The detection of attack instances might become significantly more difficult if the adversaries adopt a stealthy mode of malicious intent injection. With all these in mind, we first define a fine-grained threat model that facilitates the threat of malicious intent injection in an AI-native network. Alongside, we investigate four malicious intent injection strategies$-$ stealth-mode, random distribution, increasing frequency, and decreasing frequency- and propose a dual-path detection framework: (i) a CNN using TF-IDF features for supervised malicious intent detection, and (ii) an AutoEncoder trained exclusively on benign data for one-class malicious intent detection. Our evaluation demonstrates strong detection performance, with accuracy improving to 0.97 (~9\% gain) and F1-score to 0.98 (~36\% gain) over the state-of-the-art baseline.

Thu 10 SeptNetworking and Internet ArchitectureCryptography and SecurityMachine Learning
The gist
Networks that use AI to set themselves up can be tricked by bad commands hidden inside normal ones. This paper explains how attackers might secretly insert these harmful commands to disrupt the system. The authors created a method that uses two AI tools to spot when these sneaky attacks happen. Their approach catches threats better than existing techniques, making future networks safer.
Open 2609.12144v1

ZipCodec compresses speech using ultra-low frame rate and bitrate

ZipCodec: Ultra-Low-Frame-Rate Streaming Speech Coding

Abstract: Neural audio codecs are a fundamental component of modern speech generation systems. While recent codecs achieve increasingly low bitrates, reducing frame rate remains challenging, as each token must preserve more information while maintaining reconstruction quality. We present ZipCodec, a streaming neural speech codec operating at 6.25 Hz and 0.80 kbps with a theoretical latency of 160 ms. Our approach combines large-scale WavLM distillation with a redesigned transformer-based architecture, a scalar spherical quantizer, and a latency-aware streaming decoder. Experiments show that ZipCodec substantially outperforms existing streaming codecs at comparable bitrates in both reconstruction and downstream tasks, while operating at a significantly lower frame rate. Despite its 842M parameters, ZipCodec achieves real-time single-stream inference on a consumer-grade CPU. Demo samples, code and checkpoints are available at https://lucadellalib.github.io/zipcodec-web/.

Thu 10 SeptSoundArtificial IntelligenceMachine Learning
The gist
Compressing speech for streaming usually requires sending many small pieces quickly, which is hard to do well at very low frame rates. The authors present ZipCodec, a new technology that sends fewer pieces of speech data per second while keeping sound quality good enough to understand. They built ZipCodec using advanced methods like a special transformer design and clever data compression techniques. ZipCodec works fast enough to run in real time on regular computers and is better than other tools at similar data rates.
Open 2609.11642v1

New linear programming method improves bounds for error correcting codes

Linear Programming Bounds for LCD Codes via Gauss Phases

Abstract: For $q\in\set{2,3}$, we show that a $k$-dimensional linear code over the finite field $\F_q$ of order $q$ is linear complementary dual (LCD) exactly when one root-of-unity value of its weight enumerator has magnitude $q^{k/2}$. We convert the phase of this value, together with the parity type in the binary case, into exact linear constraints on the weight distribution and incorporate them into a Gauss-phase linear program. The resulting program uses only the ordinary weight distributions of the code and its dual and adds only a constant-size set of branch equations to the usual Hamming/MacWilliams constraints, so it remains close in size to the standard Hamming LP while retaining additional arithmetic information. Computations over the audited binary and ternary ranges show systematic strengthening of the Hamming LCD relaxation. In the binary case, comparison with the established mixed joint-weight-enumerator LP yields four strict improvements, lowering the benchmark upper bound by one in each case. Each strict comparison is verified exactly by rational feasibility witnesses and integer Farkas certificates.

Tue 8 SeptInformation TheoryDiscrete Mathematics
The gist
This paper explores a special kind of error-correcting code called LCD codes, which are used to detect and correct errors in data. The authors found a new way to use math and linear programming to better understand and limit the possible arrangements of these codes, making the analysis more precise. Their new method uses fewer complex constraints but still improves on previous techniques. They tested their method on known cases and showed it can produce tighter bounds than existing approaches.
Open 2609.08662v1