
ALT Once a status update enters service, age-optimal policies must wait for it, even when heavy-tailed delays inflate the Age of Information (AoI). We develop a framework in which the sender may preempt the update in service and sample a fresh one, under general service-time distributions and explicit action costs. Our framework covers sources that generate updates at will as well as random update arrivals. Under nondecreasing age costs, we prove that, with preemption, a finite mean delay suffices for a finite average age even under infinite delay variance. We show the optimality of constant service-age thresholds from prior work for exponential service, and exhibit numerically that for general delays the optimal preemption rule depends on both the AoI and the elapsed service time. Under an action-cost budget, we further minimize the Value at Risk (VaR), which bounds the AoI except for a prescribed fraction of time, and the Conditional Value at Risk (CVaR), the mean AoI over that fraction.

ALT Upper-mid-band XL-MIMO can exploit line-of-sight propagation, but periodic uniform cylindrical arrays may produce grating ridges. We analyse a spherically tessellated concentric circular antenna array with non-separable facet orientations. Under fixed normalised chord spacing and ideal facet visibility, we prove that user channels become asymptotically orthogonal and matched-filter SINR approaches the single-user SNR. Simulations confirm interference decay and SINR convergence. A spectral comparison shows that facet-normal diversity prevents the full-amplitude grating ridges of the cylindrical baseline, with the inter-facet residual decaying with array size.

ALT Satellite-mounted metasurfaces (MS) provide a low-power programmable paradigm for 6G satellite-terrestrial networks, effectively compensating for severe free-space path loss under stringent payload constraints. However, accurate channel prediction for such systems remains fundamentally challenging due to the coupling of dynamic orbital topology, stochastic user geometry, and hardware-imposed phase quantization. This paper proposes a physics-informed deep learning (PIDL) framework that embeds the physics of wireless communication, including monotonicity constraints and asymptotic decay properties, into a deep neural network for outage probability (OP)-aware channel prediction. We construct a realistic system model incorporating spherical user distribution, Spherical Poisson Point Process-based satellite constellation, and practical metasurface quantization. Simulation results demonstrate that the proposed framework achieves over 0.99 prediction accuracy with physically consistent outage

ALT Port selection in fluid antenna systems (FAS) requires instantaneous channel state information, but a single radio-frequency chain can probe only a few ports in each coherence block. Existing FAS channel estimators, even with learned or generative priors, work within a single block and are limited by its few probes, which cannot resolve several propagation paths. To overcome this limitation, we propose a two-timescale channel estimation and port selection scheme that exploits the slow variation of the path angles. Specifically, a sequential Monte Carlo filter accumulates the angle posterior over blocks, while the fast-fading path gains are integrated out in closed form. Furthermore, a Fisher information analysis reveals that a single probe per block carries no angle information, whereas two or more spread-out probes accumulate it linearly over blocks. Simulation results demonstrate that the proposed scheme approaches the selection with known angles after about twenty blocks and, with f

ALT The toroidal distance naturally describes the geometry of codes over ℤq, where distances are measured modulo q. In this paper, we study asymptotic bounds for codes in ℤqⁿ under the toroidal metric. We first derive an explicit asymptotic lower bound from the classical Gilbert–Varshamov bounds for the Hamming and Lee metrics, which serves as a baseline for comparison. We then develop a saddle-point approach for the toroidal metric, which yields an asymptotic Gilbert–Varshamov lower bound and an asymptotic Hamming-type upper bound. For 3∣ q, we embed ternary Hamming codes into ℤqⁿ and obtain another asymptotic lower bound for the toroidal metric. In addition, we derive an asymptotic lower bound for Maximum Toroidal Distance (MTD) codes. We compare these lower bounds with the baseline and prove that they are nontrivial in the corresponding parameter ranges. Finally, we compare the asymptotic bounds numerically.

ALT This correspondence enables practical frequency-division duplex (FDD) operation in cell-free massive MIMO via two mechanisms. Sparse access-point (AP) activation reduces downlink pilot overhead to enable coherent detection, while angle-reciprocity precoding steers beams using only uplink-estimated angles, eliminating channel feedback entirely. A load-adaptive dual-mode optimizer further enhances performance: closed-form signal-to-leakage-and-noise-ratio precoding for high-load rate boosting, or semidefinite relaxation for low-load power minimization. Simulations verify its superiority over existing feedback-free FDD solutions in spectral and energy efficiency, and its robustness to angle errors, reciprocity mismatch, and multipath.

ALT We investigate Euclidean self-orthogonality and the generalized Reed–Solomon (GRS) property for coefficient-vector codes generated by a monic polynomial g and its shifts xg,…,xᵏ⁻¹g, of length n=r+k and dimension k, where °g=r and 3≤ k≤ r. We give a complete classification, over any algebraically closed field, of the generators for which these codes are both self-orthogonal and GRS. Such generators have either distinct roots in a geometric progression satisfying explicit order and scalar conditions, or a single repeated root in certain positive characteristics. In particular, only finitely many generators occur for fixed r, k, and characteristic. We determine their maximal self-orthogonal lengths, show that the corresponding maximal-length codes are cyclic or negacyclic, and obtain exact generator counts over finite fields, together with the least fields of definition. In contrast, when 3≤ k<r, we prove that every algebraically closed field supports infinitely many pairwise monomially i

ALT Quantum locally recoverable codes with (r,δ)-locality ((r,δ)-qLRCs) are quantum error-correcting codes in which δ-1 erased qudits can be recovered by accessing only r other qudits. The minimum locality of a qLRC is the least r such that it has (r,δ)-locality. This paper aims to construct optimal impure (r,δ)-qLRCs with disjoint recovering sets and explicit minimum localities, where the optimality is measured by the Singleton-like bound of Guruswami, Kshirsagar, and Trivedi (GKT-optimal). Such qLRCs have particular advantages in recovering as many quantum erasures as possible while operating in parallel and with minimal qudit access overhead. We first characterize the recovering sets and the minimum locality of any CSS code by local relative distances, which are relative minimum distances of punctured codes with respect to shortened codes. We then construct impure qLRCs as CSS codes from nested pairs of generalized monomial-Cartesian codes. Grouping the monomials by their degree in the

ALT Fluid antenna systems (FAS) have emerged as a promising technology for enhancing wireless communications through adaptive antenna repositioning. Recently, Fourier neural operators (FNOs) have shown strong potential for FAS channel estimation owing to their ability to learn resolution-invariant mappings and generalize across different port densities. However, existing operator learning approaches require densely sampled channel realizations as training labels, whereas a practical receiver only collects noisy pilot observations from a small subset of ports. This mismatch between training requirements and practical channel acquisition poses a major obstacle to deployment. To address this challenge, we develop a self-supervised framework that trains the FNO-based estimator directly from noisy sub-sampled pilots without any labeled channel fields. The proposed objective combines a pilot splitting strategy, which creates supervision at ports hidden from the model input, with a correction bas

ALT Codebooks with small inner-product correlation play a central role in direct spread code division multiple access communications, space-time coding, compressed sensing, and related areas because they improve system performance. This paper presents a generic construction and a modified construction of complex codebooks from functions on finite Abelian groups. By choosing perfect nonlinear functions, we systematically obtain several families of optimal or asymptotically optimal codebooks with respect to the Welch or Levenshtein bounds. These constructions recover a number of known optimal codebooks and also yield new codebooks with previously unreported parameters.

ALT We consider the probabilistic nonadaptive group testing problem, in which a uniformly random defective set of size d is to be identified among N items using a binary test matrix. For the explicit Kautz–Singleton construction, it is known that order-optimal scaling T=Θ(dlog N) for high-probability recovery can be achieved in the regime d=Ω(log² N). However, the leading constant in this scaling remains uncharacterized even for standard low-complexity decoders. In this work, we revisit the probabilistic analysis of this construction and improve the leading constant for the COMP decoder, as well as establishing the same bound for the DD decoder. Our approach relies on a sharper analysis of the number of distinct roots associated with the defective items, yielding tighter bounds on the decoding error probability. In particular, we show that both COMP and DD achieve vanishing average error probability with T≤ (1/ln 2+ε)dlog N tests for any ε>0, in the admissible regime N=q^k for some prime p

ALT This paper determines the generalized covering radii, deep holes, and complete coset leader weight distribution of the antiprimitive narrow-sense BCH code of length q+1 and designed distance 3 over Fq, where q=2ᵐ and m≥ 2. We establish the complete generalized covering-radius hierarchy: the covering radius is 3, whereas the t-th generalized covering radius is 4 for every t≥ 2. Using the covering radius, we then derive necessary and sufficient conditions for a received word to be a deep hole by reducing the syndrome representations to conditions involving roots of an associated cubic polynomial. An explicit parametrization yields complete, nonredundant representatives of all deep-hole cosets. Enumerating these representatives gives closed-form expressions for the numbers of deep holes and determines the complete coset leader weight distribution, with distinct formulas according to the parity of m.

ALT For given random variables (X,Y), functional representation lemma states that there exists a random variable Z and a deterministic function g such that Y = g(X,Z), and X is independent of Z. In other words, Z captures all the information about Y not contained in X. We refer to Z as a `perfect functional representation' if it satisfies I(Y;Z) = H(Y|X). We show that the existence of perfect representation depends solely on the conditional distribution pY|X and define the corresponding conditional distributions as perfectly representable. We provide a necessary and sufficient condition for pY|X to be perfectly representable. Moreover, we cast the problem of checking perfect representability as a linear program, give an algorithm whose complexity is polynomial in |Y| and exponential in |X|, and prove that deciding perfect representability is NP-complete for rational input matrices encoded in binary.
![We prove that no binary linear [65,9,≥slant29] code exists, equivalently, that no even binary linear [66,9,≥slant30] code exists. Together with known constructions, this determines d₂(65,9)=28, n₂(9,29)=66, and n₂(9,30)=67. A residual-code bound and a known construction also give d₂(122,10)=56. To prove nonexistence, we associate with a hypothetical even code a quadratic function derived from half the codeword weight modulo 2. Its polar form determines the fourth derivative of a Boolean function of degree at most four. Character sums, weight moments, and the exclusion of weight-42 codewords give upper bounds on the support of this function in seven cases. Restrictions to nondegenerate affine subspaces exclude six cases. In the remaining case, equality would force four distinct coordinate functionals to be identically 1 on an affine seven-space, although at most two can have this property. The argument uses published minimum-length results for binary linear codes of dimensions eight and](https://pbs.twimg.com/media/HXjKefUWwAAasVL.png?name=small&format=webp)
ALT We prove that no binary linear [65,9,≥slant29] code exists, equivalently, that no even binary linear [66,9,≥slant30] code exists. Together with known constructions, this determines d₂(65,9)=28, n₂(9,29)=66, and n₂(9,30)=67. A residual-code bound and a known construction also give d₂(122,10)=56. To prove nonexistence, we associate with a hypothetical even code a quadratic function derived from half the codeword weight modulo 2. Its polar form determines the fourth derivative of a Boolean function of degree at most four. Character sums, weight moments, and the exclusion of weight-42 codewords give upper bounds on the support of this function in seven cases. Restrictions to nondegenerate affine subspaces exclude six cases. In the remaining case, equality would force four distinct coordinate functionals to be identically 1 on an affine seven-space, although at most two can have this property. The argument uses published minimum-length results for binary linear codes of dimensions eight and

ALT Let n be a composite positive integer coprime to char(Fq) and let t = lpf(n) be the least prime factor of n. In this paper we study the cyclic codes Cₙ,ₜ = 〈Qₙ(X)Qₜ(X)〉 and Cₙ,ₜ,₁ = 〈Qₙ(X)Qₜ(X)Q₁(X)〉 over Fq, where Qd(X) denotes the d-th cyclotomic polynomial. These codes extend the families Cₙ = 〈Qₙ(X)〉 and Cₙ,₁ = 〈Qₙ(X)Q₁(X)〉 recently studied by Bhagat and Sarma. We determine the exact minimum distances of Cₙ,ₜ and Cₙ,ₜ,₁, showing that d(Cₙ,ₜ,₁) = 2t and that d(Cₙ,ₜ) equals t if t² ∤ n, and 2t if t² ∣ n. For the dual codes, we establish d(Cₙ,ₜ⊥) = 2ω⁽ⁿ), handling the case ω(n) ≤ 2 via the Hartmann–Tzeng bound, and the case ω(n) ≥ 3 via a direct-sum decomposition Cₙ,ₜ⊥ = Cₙ⊥ ⊕ Vₜ and the tensor-product structure of Cₙ⊥ over its prime-power components. As applications, we show that all four code families are linear complementary dual (LCD) and locally recoverable (LRC), and we determine their locality parameters, identifying several infinite families that are r-optimal or d-optimal wit

ALT The grabbag channel models communication through a randomly mixed store. At each use, an input ball of one of K colors is inserted into a bag containing M balls, and one of the resulting M+1 balls is selected uniformly, observed, and removed. We show that, when 2≤ K≤ M+1, both the capacity without feedback and the capacity with noiseless strictly causal output feedback are at most 9.77(K/(M+1))²/³, and that, when moreover M+1≥2²², both are at least an absolute constant times (K/(M+1))²/³. Hence, both capacities are of order (K/M)²/³, and of order M⁻²/³ for every fixed K. The converse is a single bound on the information that a feedback code conveys in n uses, valid for every initial state. For each initial state, it bounds the information in each output by the change of a potential of the posterior law of the state given the earlier outputs, defined through noisy cube roots of the color counts. A budget on the true state bounds the total cost of the uses in which the inserted color is

ALT We derive a sharp upper bound on the relative entropy D(P‖Q) in terms of the two ordered chi-squared divergences χ²(P‖Q) and χ²(Q‖P). For any A,B>0, the constraints χ²(P‖Q)≤ A and χ²(Q‖P)≤ B yield upper bounds on D(P‖Q) and D(Q‖P). Two pairs of Bernoulli distributions each attain both bounds simultaneously. As a consequence, for sequences of probability mass functions {Pₙ} and {Qₙ} on a common finite or countably infinite alphabet, both D(Pₙ‖Qₙ) and D(Qₙ‖Pₙ) tend to zero whenever one of the two ordered chi-squared divergences tends to zero and the other remains uniformly bounded. Without this boundedness assumption, D(Pₙ‖Qₙ) can fail to converge to zero even when χ²(Qₙ‖Pₙ)→ 0. Finally, in contrast to the attainable upper bounds, on any finite or countably infinite alphabet containing at least three elements, the infimum of D(P‖Q) under the exact constraints χ²(P‖Q)=A and χ²(Q‖P)=B is zero and is not attained.
![The hull Hull(C)=CcapC^perp of a linear code C⊆Fq^n interpolates between linear complementary dual (LCD) codes, with trivial hull, and self-dual codes. Its dimension is preserved by coordinate permutations but not by scalings Cmapstox⋅C, x∈(Fq*)^n. This governs the complexity of Sendrier's support-splitting algorithm and decides whether an equivalence class contains LCD codes. We study this hull-variation problem, formalised by Chen, for algebraic geometry codes C(D,G) over a function field ℱ/Fq of genus g>0, where scalings are twists of G by principal divisors; as a natural relaxation, we allow twists Gmapsto G+L by arbitrary divisors. Writing C(D,G)^perp=C(D,H), with H=D-G+W, W canonical, a twist acts by (G,H)mapsto(G+L,H-L). Whenever \gcd(G+L,H-L) is non-special, the hull dimensions of C(D,G+L) and C(D,G) differ by exactly ¹⁄₂(deg|G-H|-deg|G-H+2L|). For a genuine scaling, L=-(z), this variation is bounded by 2[ℱ:Fq(z)]. Under the same hypothesis, we obtain an upper bound on the hull](https://pbs.twimg.com/media/HXfmjFIXAAAkRgd.png?name=small&format=webp)
ALT The hull Hull(C)=CcapC^perp of a linear code C⊆Fq^n interpolates between linear complementary dual (LCD) codes, with trivial hull, and self-dual codes. Its dimension is preserved by coordinate permutations but not by scalings Cmapstox⋅C, x∈(Fq*)^n. This governs the complexity of Sendrier's support-splitting algorithm and decides whether an equivalence class contains LCD codes. We study this hull-variation problem, formalised by Chen, for algebraic geometry codes C(D,G) over a function field ℱ/Fq of genus g>0, where scalings are twists of G by principal divisors; as a natural relaxation, we allow twists Gmapsto G+L by arbitrary divisors. Writing C(D,G)^perp=C(D,H), with H=D-G+W, W canonical, a twist acts by (G,H)mapsto(G+L,H-L). Whenever \gcd(G+L,H-L) is non-special, the hull dimensions of C(D,G+L) and C(D,G) differ by exactly ¹⁄₂(deg|G-H|-deg|G-H+2L|). For a genuine scaling, L=-(z), this variation is bounded by 2[ℱ:Fq(z)]. Under the same hypothesis, we obtain an upper bound on the hull

ALT Iterating Jeffrey's update on fixed evidence gives a maximum-likelihood estimate under suitable support conditions. What is less clear would be how the trajectories are organized, and what happens when we trace them in reverse. For a fixed strictly positive, invertible classical channel and full-support evidence, reverse iteration corresponds to repeated prior hacking. Almost every interior prior then approaches certainty in one possibility while each nontrivial step worsens agreement with the evidence. We call this limiting behavior radicalization. Priors that approach the same pure state form a Bayes phase. In the phase diagrams, the separating trajectories instead approach facet fixed points determined by M-projections. We also ask whether one can choose evidence that brings every interior prior to the same conclusion. For a strictly positive, invertible channel this is always possible, although one cannot always prescribe which conclusion it will be

ALT Linear transformations are considered over finite commutative rings. It is shown that the information exchange of an invertible linear transformation and that of its inverse are equal for any ring. It is also shown that the information exchange of any linear transformation and that of its transpose are equal if and only if the ring is Frobenius. Applications are presented to the Discrete Fourier Transform, to the analysis of Vandermonde transformations, and to area-time complexity.
