New families of additive non-RS MDS codes and ACD codes from twisted Reed-Solomon codes

Xia Li; Yu Wang; Yansheng Wu

Home/Archive/arXiv

arXiv · 2610.35105

New families of additive non-RS MDS codes and ACD codes from twisted Reed-Solomon codes

Xia Li·Yu Wang·Yansheng Wu

View original source ↗Read source document ↗Export metadata ↓

Abstract

Additive codes generalize linear codes and play an important role in the construc?tion of quantum codes. As generalizations of linear MDS codes, additive MDS codes have received much research attention. As an important subclass of additive codes, ACD codes are widely used for quantum error correction. In this paper, we study single-twist additive generalized twisted Reed-Solomon (GTRS) codes over finite fields. We derive necessary and sufficient conditions for these codes to be MDS for arbitrary hook and twist parameters. Then we employ Schur squares to prove that such additive MDS codes are not monomially equivalent to additive Reed-Solomon codes. We also identify a class of additive GTRS codes whose duals remain additive GTRS codes, and show that, for all sufficiently large prime powers q whose characteristic avoids a finite set, such GTRS codes yield ACD codes.

Explore related subjects

cs.IT math.IT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Xia Li, Yu Wang, Yansheng Wu. 2026-10-26. New families of additive non-RS MDS codes and ACD codes from twisted Reed-Solomon codes. https://arxiv.org/abs/2610.35105

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Hierarchical Joint Source-Channel Coding with Constrained Information Leakage

This paper studies the hierarchical joint source-channel coding with information leakage constraint in the first-phase reconstruction and distortion constraints. The receiver's access to the data varies and is evaluated by the quality of the side information. Due to the consideration of channel capacity limitation or the efficiency of the system performance, the encoder may send some additional information in Phase 1 that can only be decoded in Phase 2 with higher-quality side information. While this can optimize the overall performance, the additional information causes excessive information leakage. We provide general inner and outer bounds for the conditions such that a given distortion-leakage pair $(D_1,D_2,L)$ is achievable, together with a capacity-achieving condition.

cs.IT↗

arXiv2026

Reduced-Feedback Hybrid Precoding for Wideband mmWave MIMO-OFDM Systems via Hierarchical Interpolation

In this paper, we propose a feedback-efficient hybrid precoding framework for wideband millimeter-wave (mmWave) multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems. To reduce the hardware cost of radio-frequency (RF) chains and the feedback burden associated with frequency-selective digital precoding, frequency-flat analog precoders and combiners are first constructed from the dominant angle-of-arrival (AoA) and angle-of-departure (AoD) directions associated with the strongest propagation paths. For digital precoding, a shared quantized codebook is designed using the Lloyd algorithm, and a binary-search-based hierarchical interpolation method is developed to identify codeword switching locations between adjacent pilot subcarriers. By avoiding exhaustive codeword comparisons over all intermediate subcarriers, the proposed method reduces online search complexity and enables compact digital-precoder feedback. For the considered system configuration, the proposed method achieves a worst-case feedback reduction of approximately 98.34% relative to full-grid per-subcarrier feedback. Simulation results further demonstrate competitive spectral efficiency and bit error rate (BER) performance, low computational cost, and robustness under imperfect effective channel state information (CSI).

cs.IT↗

arXiv2026

SateBeam: Beam-Aware Radio Map Estimation With Physics-Consistent Parametric Modeling for Unknown Multiple Satellites

Dense low-Earth-orbit (LEO) networks increasingly reuse spectrum across moving satellites and overlapping beams, making a spatial radio map essential for interference diagnosis and coordination. Constructing such a map from sparse ground power measurements is difficult because the active satellite subset and its cardinality are unknown, candidate footprints can be highly coherent, and beam pointing, width, effective power, Doppler, and background must be inferred jointly. Known ephemerides do more than enumerate visible candidates. Propagated positions determine candidate-specific ranges, viewing geometry, and spatial footprints, while radial velocities induce distinct time-frequency signatures. Their joint spatial--Doppler structure rejects candidates whose geometry or time--frequency signature conflicts with the observations before continuous beam inference. SateBeam therefore screens all candidates through Doppler-resolved nonnegative fitting. GPU-accelerated grid correlations initialize continuous off-grid refinement; a Gamma-likelihood Bayesian information criterion (BIC) selects model cardinality, and backward deletion and exchange repair greedy support errors. Across paired real-ephemeris scenarios, SateBeam recovers the exact support in every case and reduces independent-query RMSE from $0.655$ to $0.050$ dB relative to orthogonal matching pursuit, with consistent advantages under model mismatch and larger candidate sets. The code is available at https://github.com/UNIC-Lab/SateBeam.

cs.IT↗