Skip to main content
archive Search
Submit Donate Log in

Press Enter to search · Advanced search

Information Theory

  • New submissions
  • Cross-lists
  • Replacements

See recent articles

Showing new listings for Monday, 16 November 2026

Total of 24 entries
Showing up to 2000 entries per page: fewer | more | all

New submissions (showing 10 of 10 entries)

[1] arXiv:2611.17506 [pdf, html, other]
Title: Correlation distribution for a class of Niho exponents via self-conjugate-reciprocal polynomials and Kloosterman sums
Yongbo Xia, Chunlei Li, Xiangyong Zeng, Tor Helleseth
Comments: 43 pages
Subjects: Information Theory (cs.IT); Number Theory (math.NT)

Let $q=2^m$ for an even $m\geq 6$ and let $d=s(q-1)+1$ with $4s\equiv5\pmod{q+1}$. In this paper, the correlation distribution between a binary m-sequence of period $q^2-1$ and its $d$-decimation is considered. The cross-correlation function takes seven values $q(i-1)-1$ for $0\leq i\leq 6$, and we determine their frequencies based on the study of low-degree self-conjugate-reciprocal polynomials and three mixed Kloosterman sums, which are finally expressed in terms of $K_m(1)$ and $K_m(\omega)$, where $K_m(\cdot)$ is the Kloomsterman sum on the finite field $\mathbb{F}_q$ and $\omega$ is a primitive element of $\mathbb{F}_4$.

[2] arXiv:2611.17765 [pdf, html, other]
Title: Toward the Minimal Set of Information Inequalities in Regenerating Codes: An Algebraic Approach
Rui-Juan Jing, Laigang Guo, Yan-Feng Xie, Chun-Ming Yuan
Subjects: Information Theory (cs.IT)

Information-theoretic outer bounds for exact-repair regenerating codes can be formulated as linear programs, but the associated Shannon-type systems contain many implicit equalities and redundant inequalities. We directly specify a reduced system for the $(n,n-1,n-1)$ exact-repair model using the closure structure induced by its repair dependencies. Nonempty closed sets index the reduced joint-entropy coordinates, and inseparable edges determine the defining inequalities. We prove equivalence with the initial system by characterizing its implicit equalities and establishing sufficient redundancy criteria. We also give an algorithm that constructs the directly defined system for any $n$, count its entropy coordinates, and derive an explicitly computable upper bound on its number of inequalities. For every $n\ge2$, we prove that the reduced system has no implicit equalities and that each distinct defining inequality is nonredundant and defines a facet in the nonempty closed-set coordinate space. Exact enumerations for $n\in\{2,3,4,5\}$ verify the reported system sizes.

[3] arXiv:2611.17973 [pdf, html, other]
Title: Wireless Node Ranking via Fourier-Driven Maximum-Likelihood Estimation (extended version)
Daniel Schneider, Hannes Frey
Subjects: Information Theory (cs.IT); Networking and Internet Architecture (cs.NI)

We apply non-abelian Fourier theory to the problem of maximum-likelihood estimation of the order of a line topology, based on signal strength measurements under shadowing only. This yields up to a 60-fold speedup over standard methods for uncorrelated shadowing.
Moreover, for correlated Gaussian shadowing with a singular covariance (e.g. the joint path-loss model), maximum-likelihood recovery is exact and independent of the shadowing variance (an infinite Le Cam threshold), which our implementation confirms for $\sigma/\alpha$ as high as 7.0. The key object is the covariance's null space. Its dimension is fixed by the topology; its orientation depends on the correlation function only through the per-link variances.
Although the mechanism formally requires an exact line, it is robust to small perturbations of the formation: an approximate kernel recovers as well as the exact one. We explore the dependence on the perturbation in detail for five nodes.

[4] arXiv:2611.18137 [pdf, html, other]
Title: Rate Optimal Streaming Codes Under an Extended Delay Profile for Three-Node Relay Networks
Ke Wang, Wenjie Ma, Zhipeng Li, Yaqiang Zhang
Comments: 27 pages
Subjects: Information Theory (cs.IT)

We study streaming codes for a three-node relay network with burst lengths $b_1,b_2$ and an end-to-end decoding delay $T$. Let $u=\max\{b_1,b_2\}$ and $v=\min\{b_1,b_2\}$, and write $T-v=pu+q$, where $T\ge u+v$ and $0\le q<u$. We develop two binary constructions, SR and SR-2, using extended delay profiles that allow the relay to forward causally invertible combinations of current and past source symbols. The SR construction attains the non-adaptive rate upper bound whenever \[ \frac{T-u-v}{2u-v}\le\left\lfloor\frac{T-u-v}{u}\right\rfloor. \] SR-2 enlarges this range under the sufficient condition \[ q(v-q)\le(p-1)u(u-v). \] These constructions complement the known divisibility and large-delay regimes. We also establish two limitations of systematic ordinary coordinate forwarding. First, it cannot attain the rate upper bound when $0<T-u-v<v$. Second, for equal burst lengths $b$, it attains the bound if and only if $b\mid(T-2b)$; a quantitative upper bound gives a strictly positive rate gap in every nondivisible case. These converses allow nonlinear components and predetermined time variation within the stated ordinary-forwarding architecture. Existing adaptive schemes for equal bursts approach the same rate upper bound asymptotically using time-varying convolutional codes and lie outside the non-adaptive setting considered here.

[5] arXiv:2611.18156 [pdf, html, other]
Title: Hamming and Johnson-Type Bounds for Joint Error Correction and Detection
Yulin Chen, Raymond W.Yeung
Comments: This manuscript is a preliminary draft and is currently being revised. The final version will be posted once the revisions are complete. Comments and suggestions are welcome
Subjects: Information Theory (cs.IT)

We derive upper bounds on the size of codes for joint error correction and detection over classical $q$-ary Hamming spaces. A $(c,c')$ joint error correcting and detecting code corrects every error of weight at most $c$ and detects every error whose weight lies between $c+1$ and $c+c'$. We establish equivalent conditions for this decoding requirement using Hamming balls and Hamming rings, and derive a joint bound that reduces to the Hamming bound when $c'=0$. We introduce joint perfect codes and show that binary repetition codes attain the joint bound whenever $n=2c+c'+1$. For codes satisfying $d_{\min}=2c+c'+1$, we investigate an alternative joint bound based on ring multiplicity and constant-weight code bounds. A further argument using the Cauchy-Schwarz inequality and pairwise ring intersections yields a refined joint bound that is always at least as strong as the original joint bound. We then incorporate an additional outer Hamming shell to obtain a Johnson-type extension. This extension provides a strict improvement for binary codes with $c'=1$, $d_{\min}=2c+2$, $c\geq2$, and $d_{\min}+2\leq n\leq3d_{\min}/2-1$. These results connect sphere-packing bounds with the geometry of joint error correction and detection.

[6] arXiv:2611.18196 [pdf, html, other]
Title: Movable Antenna-Aided ISAC: A Time- and Frequency-Division Framework
Yuyan Zhou, Haocheng Hua, Jie Xu, Rui Zhang
Comments: 13 pages, 9 figures, 1 table
Subjects: Information Theory (cs.IT)

This paper investigates movable-antenna (MA)-enhanced integrated sensing and communication (ISAC) under time division duplex (TDD) and frequency division duplex (FDD) protocols, where sensing and communications occupy orthogonal time and frequency resources, respectively. A wideband target-position Cramér-Rao bound (CRB) is derived under a pulse-radar framework with pulse compression, incorporating delay and angle estimation error bounds in Cartesian coordinates. Both bounds depend on sensing power; the delay bound also depends on sensing bandwidth, while the angle bound depends on the effective aperture determined by the antenna position vector (APV). A worst-case position CRB over a prescribed target region ensures robust sensing performance. For multiuser downlink communication, joint APV and resource-allocation problems are formulated for TDD and FDD to maximize the minimum achievable user rate subject to the sensing requirement. An alternating optimization algorithm is developed for FDD, while TDD is addressed by searching over feasible sensing pulse numbers combined with APV optimization. Representative scenarios clarify how MA improves channel orthogonality and enlarges the sensing aperture, and how these effects shape the TDD/FDD rate comparison. Numerical results show that APV optimization enlarges the communication-sensing tradeoff region over fixed-position antenna benchmarks. The optimized configurations exhibit distinct tendencies: TDD favors a larger antenna position variance, whereas FDD favors better channel orthogonality among users.

[7] arXiv:2611.18228 [pdf, html, other]
Title: New Results on the Subfield Metric
Ana Kosovac, Jeanette Plechinger, Nikola Spirovski, Violetta Weger
Subjects: Information Theory (cs.IT)

In this paper, we further develop the theory of the recently introduced $\lambda$-subfield metric. We investigate extremal codes, classical bounds and asymptotic densities in this setting.
We first study codes attaining a Singleton-type bound, called Maximum $\lambda$-subfield Distance (M$\lambda$D) codes. We establish structural restrictions on their parameters and extend the theory to sublinear codes. We then investigate the asymptotic density of M$\lambda$D codes in several parameter regimes and compare their behavior with that of MDS and MRD codes.
We then turn to a Plotkin-like bound, where we construct a family of constant-weight codes attaining the bound and classify all non-degenerate linear constant-weight codes for $\lambda>1$.
Finally, we complement the collection of classical coding-theoretic bounds available for the $\lambda$-subfield metric by deriving Griesmer-, Elias- and Johnson-type bounds.

[8] arXiv:2611.18358 [pdf, html, other]
Title: Quadratic APN Functions of $\mathbb{F}_2^{10}$ with a Self-Equivalence of Prime Order
Emanuele Bellini
Subjects: Information Theory (cs.IT); Cryptography and Security (cs.CR); Combinatorics (math.CO)

Almost perfect nonlinear (APN) functions of $\mathbb{F}_2^n$ have the lowest possible differential uniformity. The only known APN permutation in even dimension, in dimension six, is equivalent to a quadratic APN function with a nontrivial linear self-equivalence; no APN permutation is known for even $n \geq 8$. In a published collection of about 3.8 million quadratic APN classes of dimension eight, at most 0.34% have a nontrivial linear self-equivalence. In dimension ten, the 25 literature classes considered here all have one. We study all quadratic APN functions of $\mathbb{F}_2^{10}$ with such a self-equivalence, which usually confines them to a much smaller linear space. Up to conjugacy and power similarity, self-equivalences of prime order have 299 types. We settle 298 of them. Elementary lemmas exclude 280 types, and exhaustive searches confirm this for 242 of them. The other 18 types are settled by exhaustive searches with exact equivalence certificates. Up to extended affine equivalence, the 298 types contain 29 classes of quadratic APN functions, four of them new. This also classifies the quadratic APN functions with coefficients in a subfield. Exactly 24 classes contain one with coefficients in $\mathbb{F}_4$, and all 3 that contain one with coefficients in $\mathbb{F}_{32}$ are among them. The open type consists of the quadratic canonical triplicate functions. They correspond to maximum additive Hermitian rank-distance codes. Three different searches find only the invariants of 16 classes, all among the 29. We conjecture there are no others. No quadratic APN function in the 298 settled types is Carlet-Charpin-Zinoviev equivalent to a permutation.

[9] arXiv:2611.18476 [pdf, html, other]
Title: Beyond Blossom: Accelerating MWPM Decoding for Surface Codes With Local Predecoding and Architecture-Aware Optimizations
Jiayu Fu, Zirong Shen, Lin Gan, Yiming Zhang, Wenjing Han, Xiaoming Sun, Riling Li, Guangwen Yang
Comments: 11 pages, 8 figures
Subjects: Information Theory (cs.IT); Performance (cs.PF); Quantum Physics (quant-ph)

Minimum-weight perfect matching (MWPM) is widely used to decode surface codes, but its computational cost increases with code distance. We present Beyond Blossom, a state-of-the-art CPU-based MWPM decoder for surface codes. It combines algorithmic optimization through local predecoding, architecture-aware optimization, and pipeline-wide parallelism to reduce matching workload and execution overhead while preserving MWPM optimality. Across rotated surface codes with distances 9-33 and circuit-level physical error rates of 0.05%-0.3%, on a single CPU core, Beyond Blossom achieves a 4.23$\times$ geometric-mean speedup and up to 5.58$\times$ speedup over Sparse Blossom in PyMatching. At distance 33 and a physical error rate of 0.1%, with 8 CPU cores, decoding a block of 33 measurement rounds takes 21.40 $\mu$s on average, equivalent to 0.65 $\mu$s per round.

[10] arXiv:2611.18538 [pdf, html, other]
Title: Why Finite Intelligence Works in an Infinite World: A Mathematical Theory
Mojtaba Soltanalian
Comments: 56 pages, 5 figures
Subjects: Information Theory (cs.IT); Machine Learning (cs.LG); Machine Learning (stat.ML)

An information system often has to learn before it knows what it will be asked. A finite representation can succeed without recording an infinite environment in full when those asks share collective structure, rather than demand unrelated facts scattered arbitrarily across it. We formalize this phenomenon through future-task information, the minimum retained information needed to preserve decision value relative to the available evidence. A joint decision-regret state records posterior comparisons among actions for every permitted task. Under compactness assumptions, every retained representation admits a calibrated replacement based on this state, preserving all task regrets without increasing information; the resulting information-regret curve equals an operational coding rate. Two exact boundaries govern finite preservation: weak-star closure for a fixed action count, and the singular mass of the source-evidence law when all finite action menus are admitted. Collective structure determines information requirements beyond individual-question difficulty. Families with identical source laws, pairwise task metrics, and individual-task rates can have different high-resolution exponents. Covariance-identical coordinate and parity families have different exact rate-distortion curves, with optimal parity retention characterized by a sharp Fourier-entropy inequality. For balanced nested task families, refinement sizes and weighted reach determine the rate within an additive constant, attained by prefix coding under explicit decay conditions. Nonlinear learning and computational separations distinguish preservation from efficient discovery and use. The proposed mathematical theory identifies which shared decision requirements allow finite information to remain useful for infinitely many possible purposes.

Cross submissions (showing 5 of 5 entries)

[11] arXiv:2611.17393 (cross-list from cs.CR) [pdf, html, other]
Title: Evolutionary-based Transfer Learning for Physical Attack on End-to-End Autoencoder Communications
Ho Viet Duc Luong, Lang Hong Nguyet Anh, Huynh Thi Thanh Binh, Trinh Van Chien
Comments: 31 pages, 10 figures, and 4 tables. Accepted by JNCA
Subjects: Cryptography and Security (cs.CR); Information Theory (cs.IT)

End-to-end autoencoder communication has emerged as a promising means of achieving efficient data transmission across various domains. Nevertheless, vulnerabilities have recently been revealed in these systems by adversarial attacks, wherein malevolent entities manipulate the transmitted signals to deceive the autoencoder. This paper leverages the applications of evolutionary algorithms to solve a challenging optimization problem of launching physical attacks against end-to-end autoencoder communication. For white-box scenarios, we introduce PAGA (Physical Attack based on Genetic Algorithm), which combines a genetic algorithm with elite population initialization to craft attack signals that degrade autoencoder performance. To gauge the efficacy of these attack signals, we employ a fitness function that assesses their capacity to induce substantial reconstruction errors and misclassification rates. A Multi-Factorial version of PAGA, referred to as PAMFGA, is proposed to deal with practical scenarios where the attackers have limited knowledge about the receiver, also known as a black-box attack. Our experimental results show that the proposed attacks can substantially degrade the reliability of the considered autoencoder communication systems across the evaluated settings. This study also underscores the critical importance of incorporating security considerations into the design and implementation of end-to-end autoencoder communication systems.

[12] arXiv:2611.17492 (cross-list from cs.LG) [pdf, html, other]
Title: PF-Exec: Large-Scale UAV Relay Load Balancing with an Anchored Potential Direction Decider and a Per-Dimension Gain-Learning Executor
Liheng Zeng, Hanzhang Jia, Yiran Li, Yi Gao, Bo Ma
Subjects: Machine Learning (cs.LG); Information Theory (cs.IT); Signal Processing (eess.SP)

Relay load balancing in large-scale UAV networks requires joint decisions on association, bandwidth, power and hovering position, while the dimension grows with the number of UAVs and each UAV sees only its local state. This paper splits the decision into two layers. An anchored potential direction decider emits a closed-form target at every instant and returns its direction only. A gain-learning executor maps a local observation into a positive gain per dimension, composes gain and target, and clips the action against the physical single-step bound; the two layers form PF-Exec. The unit gain is the default start, so the executor reduces to the pure potential policy before training. The load is first-order homogeneous in bandwidth, making the bandwidth target closed form, and the position target is the demand-weighted centroid of the served users. The system uses a two-hop access and millimetre-wave backhaul link with soft association, a 3GPP UMa-AV channel with two shadowing layers, an OU-type social-force crowd and a quadrotor physical layer. Evaluation spans all fleet sizes, two crowd scenarios, independent seeds, the published baselines in their own settings and a degraded-information line. In the highest-pressure burst setting the fixed-step comparison breaks down on part of the seeds, losing fairness and mean load at once, while PF-Exec holds fairness near one. Among the ten comparison methods only the greedy heuristic survives that setting; its load variance stays far higher. Under stale global state and position noise the fairness index stays high at both largest-scale scenarios. Flight energy is nearly identical between the learned and the fixed-step executor, and three constants are fixed once across all settings. The convergence properties of both layers, from the truncated gain iteration to the perturbed tracking bound, are proved in the companion analysis.

[13] arXiv:2611.17678 (cross-list from math.CO) [pdf, html, other]
Title: Nonexistence of a quasi-symmetric $2$-$(33,15,35)$ design
Masaaki Harada
Subjects: Combinatorics (math.CO); Information Theory (cs.IT)

It is shown that there exists no quasi-symmetric $2$-$(33,15,35)$ design with intersection numbers $6$ and $9$. This is proved by considering the ternary code generated by the incidence vectors of the blocks and its dual code.

[14] arXiv:2611.18181 (cross-list from eess.SP) [pdf, html, other]
Title: Linear Dynamic Range Extension for Rydberg Atomic Receiver via Band-Limited Reconstruction
Meng Fang, Lebin Chen, Jun-Rong Chen, Ming-Min Zhao, Bin-Bin Wei
Comments: 6 pages, 7 figures
Subjects: Signal Processing (eess.SP); Information Theory (cs.IT)

Rydberg-atom receiver offers a promising approach to radio-frequency (RF) signal reception in wireless communication and sensing systems, combining high sensitivity with the potential for broad frequency coverage. However, the limited linear dynamic range (LDR) of the atomic system causes nonlinear distortion at high input signal levels, thereby restricting the receiver's effective linear input range. To address this issue, we analyze the mechanisms underlying nonlinear distortion in Rydberg atomic receivers and propose a physics-informed band-limited iterative reconstruction (PI-BLIR) method. Specifically, by exploiting the known nonlinear atomic response and signal bandwidth prior, we formulate a constrained maximum-likelihood problem to reconstruct the distorted complex intermediate-frequency (IF) waveform. With the bandwidth constraint absorbed into the frequency-domain parameterization, the constrained maximum-likelihood problem is transformed into an unconstrained optimization problem, which is solved using gradient descent. The proposed method relies solely on digital post-processing and requires no changes to the local-oscillator (LO) field strength, optical parameters, or atomic operating conditions. Simulation results demonstrate that PI-BLIR extends the receiver's LDR by more than 14 dB and enhances the demodulation performance of the atomic receiver.

[15] arXiv:2611.18239 (cross-list from cs.LG) [pdf, html, other]
Title: Neural Classifiers as Error-Correcting Codes
Sergey Salishev, Anton Makarov, Oleg Granichin, Renata Avros, Zeev Volkovich
Comments: 40 pages, 6 figures. Submitted version. Published in Information Sciences 766 (2027) 124394
Journal-ref: Information Sciences 766 (2027) 124394
Subjects: Machine Learning (cs.LG); Information Theory (cs.IT)

A unified framework is proposed that characterizes supervised deep classification as the decoding of error-correcting codes in the Shannon sense. Cross-entropy optimization is shown to align softmax classifiers with maximum-likelihood decoding, where logits map to Hamming distances to class-specific codewords. This correspondence explains the emergence of standard divergence objectives (e.g., Kullback-Leibler, Jeffreys) and provides a geometric basis for the stability of decision boundaries. Furthermore, the geometries of Neural Collapse and LeJEPA are identified as optimal constellations for decoding under isotropic noise. Unlike classical Error-Correcting Output Codes, deep networks are shown to learn effective codebooks in the feature space implicitly. This insight is leveraged to derive novel criteria for lossless quantization, improved knowledge distillation, and architectural regularization based on code redundancy. Finally, this perspective is extended to self-supervised encoders, offering a cohesive explanation for the geometry of latent representations in modern neural models.

Replacement submissions (showing 9 of 9 entries)

[16] arXiv:2603.07932 (replaced) [pdf, html, other]
Title: Hard/Soft NLoS Detection via Combinatorial Data Augmentation for 6G Positioning
Sang-Hyeok Kim (1), Seung Min Yu (2), Jihong Park (3), Seung-Woo Ko (1) ((1) Inha University, South Korea, (2) Korea Railroad Research Institute, South Korea, (3) Singapore University of Technology and Design, Singapore)
Comments: 24 pages, 15 figures, 13 tables. An earlier version of this work was presented in part at the IEEE Wireless Communications and Networking Conference (WCNC) 2026. This work has been submitted to the IEEE for possible publication
Subjects: Information Theory (cs.IT); Networking and Internet Architecture (cs.NI)

A key enabler for meeting the stringent requirements of 6G positioning is the ability to exploit site-dependent information governing line-of-sight (LoS) and non-line-of-sight (NLoS) propagation. However, acquiring such environmental information in real time is challenging in practice. To address this issue, we propose a novel NLoS detection algorithm termed combinatorial data augmentation-guided NLoS detection (CDA-ND), which builds upon our prior work. CDA-ND generates numerous preliminary estimated locations (PELs) by applying multilateration over many gNodeB (gNB) combinations using a single snapshot of range measurements. When a target gNB is in NLoS, the resulting PELs split into two clusters: one derived using the target gNB's range measurement and the other derived without it. Their displacement is summarized by a single vector, called the NLoS evidence vector (NEV), which is used to compute an NLoS likelihood score. Based on this score, two modes of NLoS detection are developed. First, each gNB is classified as LoS or NLoS, termed hard decision (HD), using a simple threshold test. Second, each gNB's NLoS confidence is probabilistically quantified, termed soft decision (SD), which extends HD with weak site-survey priors, namely empirical NLoS-score samples and the average NLoS probability. We then design positioning algorithms tailored to these two modes by excluding gNBs deemed NLoS and re-weighting the remaining gNBs for SD. The proposed CDA-ND achieves high reliability in indoor factory environments under frequency range 1, attaining NLoS detection accuracies of 96.8% and 91.5% when the proportion of NLoS gNBs is approximately 18% and 56%, respectively. As a result, integrating CDA-ND into positioning significantly reduces mean absolute error by about 22% and 67% in LoS- and NLoS-dominant environments, respectively.

[17] arXiv:2604.06822 (replaced) [pdf, html, other]
Title: Non-RS type cyclic MDS codes over finite fields via cyclotomic field reduction
Can Xiang, Chunming Tang
Comments: 17pages
Subjects: Information Theory (cs.IT)

Cyclic maximum distance separable (MDS for short) codes are a special subclass of linear codes and have received a lot of attention, as these codes have very important applications in many areas including quantum codes, designs and finite geometry. However, the existing construction methods for cyclic MDS codes mainly rely on strict restrictions on certain parameters or involve relatively complex procedures. In this paper, we investigate this problem further via norm reduction in cyclotomic fields. By converting the verification of the MDS property over a finite field into checking non-zero minors in characteristic zero, we propose a construction method of cyclic MDS codes over finite fields via cyclotomic field reduction. Based on this method, we obtain several cyclic MDS codes over finite fields and many non-RS type cyclic MDS codes are produced. Compared with the existing construction method in [Non-Reed-Solomon Type Cyclic MDS Codes, IEEE Trans. Inf. Theory, 71(5): 3489--3496, 2025], we give a new and relatively direct characterization method for constructing cyclic MDS codes over finite fields and the obtained non-RS cyclic MDS codes have flexible parameters in terms of the code length $n$, the defining set $J$, and the underlying finite field $\mathbb{F}_q$.

[18] arXiv:2604.26741 (replaced) [pdf, html, other]
Title: Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
Paul Zheng, Yao Zhu, Xiaopeng Yuan, Yulin Hu, Anke Schmeink
Journal-ref: IEEE Transactions on Wireless Communications, vol. 25, pp. 25941-25958, 2026
Subjects: Information Theory (cs.IT); Signal Processing (eess.SP); Optimization and Control (math.OC)

In next-generation wireless edge systems, efficient functionality integration is essential to address the growing demands of communication, computation, and sensing. Signal-level integrated sensing, computing, and communication (Sig-ISCC) is envisioned, where a single waveform simultaneously supports sensing, computing and communication via over-the-air computation (AirComp). Meanwhile, federated learning (FL) is widely regarded as a promising distributed machine learning framework that enables network intelligence in a privacy-preserving and secure manner, and exhibits strong synergy with AirComp, which alleviates the communication bottleneck of FL. In this paper, we study uplink Sig-ISCC design for AirComp-FL with joint target detection. We formulate the joint power and receive-scaling control problem, where edge devices' transmitted signals should serve both sensing and AirComp purposes. The goal is to minimize the AirComp aggregation distortion subject to a joint target-detection requirement. Although the resulting problem is non-convex in the original variables, we show that it admits an equivalent convex reformulation after a suitable variable transformation. By exploiting analytical optimality properties, we develop a robust, optimal, and polynomial-time-complexity algorithm that efficiently achieves the optimal transmit powers and receive scaling factor. Simulation results validate the optimality and numerical robustness of the proposed algorithm and show its superior FL performance compared to baseline methods.

[19] arXiv:2605.12063 (replaced) [pdf, html, other]
Title: Memory Constrained Adversarial Hypothesis Testing
Malhar A. Managoli, Vinod M. Prabhakaran
Subjects: Information Theory (cs.IT)

We study adversarial binary hypothesis testing under memory constraints. The test is a time-invariant randomized finite state machine (FSM) with S states. Associated with each hypothesis is a set of distributions. Given the hypothesis, the distribution of each sample is chosen from the set associated with the hypothesis by an adversary who has access to past samples and the history of states of the FSM so far. We obtain upper and lower bounds on the minimax asymptotic error probability that are tight to within one state. These bounds determine the exact error exponent in S, and coincide under a weak least-favourability condition. For time-invariant deterministic FSMs, we also extend known achievable error-exponent bounds from the non-adversarial Bernoulli setting to the adversarial case with parameters in two separated intervals.

[20] arXiv:2606.24537 (replaced) [pdf, html, other]
Title: Importance Sampling for Event Discovery via Guesswork
Asaf Cohen
Comments: Short version submitted to ITW 2026. This is a longer version after being accepted to ITW, correcting reviewers comments, organizing and rephrasing, and adding more complete proofs, comments, etc
Subjects: Information Theory (cs.IT)

Traditional importance sampling (IS) is designed to estimate rare-event probabilities by minimizing estimator variance. However, many applications prioritize rapid discovery: the generation of a trajectory within a rare set $A_n$. This requires a shift from ensemble-based estimation to a design principle focused on the hitting time $\tau_{A_n} := \inf\{t \ge 1 : Y_t^n \in A_n\}$.
We formalize a Quality of Discovery problem as the problem of minimizing the description length (surprisal) of the discovered trajectory under the nominal model $p$. We prove that minimizing this description length is equivalent to minimizing the nominal rank exponent $J_{\mathrm{rank}}(q_n) := \lim_{n\to\infty} \frac{1}{n} \log G_n(Y^n)$, where $G_n(x^n)$ is the guesswork of sequence $x^n$. For i.i.d.\ models and type-defined rare sets $\Gamma$, we show that while classical IS targets the mass-dominating type $Q_{\mathrm{IS}}^* \in \arg\min_{Q \in \Gamma} D(Q\|p)$, discovery optimality is achieved by $Q_{\mathrm{GW}}^* \in \arg\min_{Q \in \Gamma} [H(Q) + D(Q\|p)]$. This framework identifies a fundamental rule: minimizing the guesswork exponent ensures the discovered sequence is the "least surprising" representative of the set relative to the nominal model's search order. We further demonstrate that under budgetary constraints, this exponent serves as a lexicographic tie-breaker when the hitting-time minimizer is not unique. This establishes $H(Q) + D(Q\|p)$ as a natural objective for discovery-based importance sampling, providing a formal bridge between randomized sampling and systematic search.

[21] arXiv:2401.13712 (replaced) [pdf, html, other]
Title: Engineering Yeast Cells to Facilitate Information Exchange
Nikolaos Ntetsikas, Styliana Kyriakoudi, Antonis Kirmizis, Bige Deniz Unluturk, Andreas Pitsillides, Ian F. Akyildiz, Marios Lestas
Comments: 18 pages, 9 figures (2 of which are not colored) all .png, recently accepted for publication at TMBMC
Subjects: Emerging Technologies (cs.ET); Information Theory (cs.IT); Molecular Networks (q-bio.MN)

Although continuous advances in theoretical modelling of Molecular Communications (MC) are observed, there is still an insuperable gap between theory and experimental testbeds, especially at the microscale. In this paper, the development of the first testbed incorporating engineered yeast cells is reported. Different from the existing literature, eukaryotic yeast cells are considered for both the sender and the receiver, with {\alpha}-factor molecules facilitating the information transfer. The use of such cells is motivated mainly by the well understood biological mechanism of yeast mating, together with their genetic amenability. In addition, recent advances in yeast biosensing establish yeast as a suitable detector and a neat interface to in-body sensor networks. The system under consideration is presented first, and the mathematical models of the underlying biological processes leading to an end-to-end (E2E) system are given. The experimental setup is then described and used to obtain experimental results which validate the developed mathematical models. Beyond that, the ability of the system to effectively generate output pulses in response to repeated stimuli is demonstrated, reporting one event per two hours. However, fast RNA fluctuations indicate cell responses in less than three minutes, demonstrating the potential for much higher rates in the future.

[22] arXiv:2601.03064 (replaced) [pdf, html, other]
Title: Similarity-Sensitive Entropy under Representation Change and Inference
Joseph Samuel Miller
Comments: 26 pages. v3: Revised abstract; generalized coarse graining proof; added further directions; revised theorem statements
Subjects: Probability (math.PR); Information Theory (cs.IT)

Similarity-sensitive entropy measures the uncertainty of a probability law relative to a similarity kernel that encodes the distinguishability of states. We develop the measure-theoretic treatment covering both finite similarity matrices and general probability spaces, and study how the law and similarity kernel transform under measurable maps, channels, and conditioning operations. This yields data-processing inequalities, so a reduction in entropy quantifies how much distinguishability is lost under representation change. We also define a conditional similarity-sensitive entropy theory, give a counterexample to a recent conjecture on concavity, and identify a practical one-dimensional Laplace kernel class where concavity holds.

[23] arXiv:2604.21909 (replaced) [pdf, html, other]
Title: Directional Confusions Reveal Divergent Inductive Biases Through Rate-Distortion Geometry in Human and Machine Vision
Leyla Roksan Caglar, Pedro A.M. Mediano, Baihan Lin
Subjects: Computer Vision and Pattern Recognition (cs.CV); Information Theory (cs.IT); Neurons and Cognition (q-bio.NC)

Humans and modern vision models can reach similar classification accuracy while making systematically different kinds of mistakes -- differing not in how often they err, but in who gets mistaken for whom and in which direction. We show that these directional confusions reveal distinct inductive biases that are invisible to accuracy alone. Using matched human and deep vision model responses on a natural-image categorization task under 12 perturbation types, we quantify asymmetry in confusion matrices and link it to the shape of the information-error trade-off. We characterize this trade-off geometry using three signatures extracted from the rate-distortion (RD) frontier: slope beta, curvature kappa and efficiency (AUC). We find that humans exhibit broad but weak asymmetries, whereas deep vision models show sparser, stronger directional collapses. Robustness training reduces global asymmetry but fails to recover the human-like breadth-strength profile of graded similarity. Mechanistic simulations further show that different asymmetry organizations shift the RD frontier in opposite directions, even when matched for performance. Together, these results position directional confusions and RD geometry as compact, interpretable signatures of inductive bias under distribution shift.

[24] arXiv:2611.17108 (replaced) [pdf, html, other]
Title: LazyWeights: Decode-on-Demand Edge LLMs
Arnab Sanyal, Gourav Datta, Sandeep P. Chinchali
Comments: 6 pages, 1 reference page, 5 figures
Subjects: Machine Learning (cs.LG); Hardware Architecture (cs.AR); Computation and Language (cs.CL); Information Theory (cs.IT)

Memory decides which LLMs an edge device runs, and how fast: capacity on a 4 GB Jetson Nano, bandwidth on an 8 GB Jetson Orin Nano Super. Deployed formats (GPTQ, AWQ, this http URL's K- and I-quants) spend equal bits on every integer code of a matrix, although the codes are far from uniform. LazyWeights keeps these formats but tunes GPTQ so the codes compress, Huffman-codes them losslessly in interleaved lanes, and decodes them on demand in a small unit between DRAM and L2, so GPU kernels run unchanged and DRAM moves only coded bytes. At 1% and 3.5% perplexity budgets, coded Phi-3-mini, Mistral-7B and SmolLM-1.7B are 5.7-31.4% smaller than the best this http URL format. A bit-exact 0.21 mm^2 ASIC decoder unit (1 GHz, 7 nm) cuts Orin latency and energy per token by up to 36% and 38% (54% and 44% with prompt-lookup speculation). On the Nano, LazyWeights needs 58-64% less time and 53-57% less energy per token than CPU this http URL, and runs a streamed Mistral-7B 6.6x faster at 3.89 bits per weight. A Huffman decoder beats an rANS decoder in rate and area at equal throughput; the ASIC decoder unit runs bit-exact on a Zynq UltraScale+ FPGA (AMD ZCU102).

Total of 24 entries
Showing up to 2000 entries per page: fewer | more | all
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)