Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1910.04472

Construction of Const Dimension Code from Two Parallel Versions of Linkage Construction

Xianmang He
View original source ↗Read source document ↗Export metadata ↓

Abstract

The linkage construction and its generalization is one of the most powerful constructions for constant dimension code, accounting for approximately 50\% of all the listed parameters. We show how to improve the linkage construction of subspace codes by two parallel versions of the linkage construction. This proof allows us to attain codes of larger size for a given minimum distance, which exceeds the latest improvements on the linkage construction \cite{combining2019Antonio} in the cases $A_q(13,4,4),A_q(17,4,4), A_q(19,6,6)$.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xianmang He. 2020-05-09. Construction of Const Dimension Code from Two Parallel Versions of Linkage Construction. https://arxiv.org/abs/1910.04472

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

KEEP EXPLORING

Related papers

arXiv2026

Second-Order Asymptotics for the Gaussian MAC on the Relative Interior of the Sum-Rate Face

We completely characterize the second-order coding rate region of the two-user Gaussian multiple-access channel at points in the relative interior of the sum-rate face, under maximal per-codeword power constraints. For any fixed average error probability $0 < \varepsilon < 1/2$, a nontrivial mixture of power splits reduces the sum-rate dispersion and strictly improves upon standard inner bounds based on a constant power split. Thus, a constant power split, although sufficient to attain the first-order capacity region, is insufficient for second-order optimality in this regime. Our achievability proof builds on the constant composition and coded time-sharing framework of Scarlett, Martinez, and Guillén i Fàbregas, with an optimization over admissible power splits. A matching second-order converse establishes the optimality of the resulting coded time-sharing strategy.

cs.IT↗
arXiv2026

Pinching-Antenna-Enabled ISAC: A Unified Architecture for Flexible Communication and Sensing

Integrated sensing and communication (ISAC) is a cornerstone of sixth-generation (6G) networks, yet conventional fixed-antenna systems lack the spatial adaptability to cope with dynamic users and targets. The emerging pinching antenna (PA) offers a flexible, low-cost solution by dynamically reconfiguring radiation points along waveguides, introducing large-scale spatial degrees of freedom. This article develops a unified architectural perspective for PA-enabled ISAC. We first discuss the unique advantages of PAs over existing flexible solutions, and then propose a PA-enabled ISAC framework that accommodates both uplink and downlink communication while being compatible with passive and active sensing targets. Within this framework, we identify representative application scenarios, discuss major design challenges, and highlight critical enabling techniques. A numerical case study demonstrates how PA reconfigurability affects the communication-sensing rate trade-off. We also outline open issues to guide further PA-ISAC research for future 6G networks.

cs.IT↗
arXiv2026

Hyper-derivative Algebraic Geometry Codes via Local Expansions

In this paper, we develop a systematic construction framework of hyper-derivative algebraic geometry codes via local expansions, extending hyper-derivative Reed-Solomon codes from the rational function field to general algebraic function fields. Using the residue theorem, we determine their Euclidean duals and illustrate that the duals naturally reverse. We further give criteria for reverse self orthogonality and reverse self duality in terms of two classes of bilinear forms. Finally, we provide an asymptotic bound on the rate and relative distance via function field towers.

cs.IT↗