Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.01228

Task-Oriented Boolean Function Computation: Practical Code Constructions

Yangshuo He·Guanding Yu·Jingge Zhu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Task-oriented communication conveys information that is necessary for downstream tasks. For binary decision tasks, this paradigm is information-theoretically formalized by Boolean function computation (BFC) via channels, where the receiver aims to determine the value of a function unknown to the transmitter. In this paper, we devise a practical code construction for the BFC problem based on a Reed--Solomon code. For noiseless binary channels, we derive finite-blocklength worst-case error bounds. By defining a rate function that captures how supported message length scales with channel uses, we characterize the rate-reliability tradeoff for different Boolean function families. With respect to this scaling, the proposed construction achieves an asymptotic computation rate of $1/2$. We further extend this construction to noisy channels by packing multiple BFC tasks into a single block and concatenating them with a conventional channel code. The corresponding finite-blocklength guarantees are expressed in terms of effective channel uses per function evaluation. With a channel code rate $R_c$, this construction achieves an asymptotic computation rate of $R_c/2$, yielding $C/2$ when capacity-achieving channel codes are employed. Numerical results illustrate the derived bounds and demonstrate substantial performance gains over conventional transmission. As examples, the proposed coding scheme achieves SNR coding gains of approximately $3.4$ and $6.4$~dB for the exact-weight and rank-test tasks, respectively.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yangshuo He, Guanding Yu, Jingge Zhu. 2026-10-01. Task-Oriented Boolean Function Computation: Practical Code Constructions. https://arxiv.org/abs/2610.01228

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

KEEP EXPLORING

Related papers

arXiv2026

Authentication Against a Myopic Adversary

We consider keyless authentication for point-to-point communication in the presence of a myopic adversary. In particular, the adversary has access to a non-causal noisy version of the transmission and uses this knowledge to choose the state of an arbitrarily-varying channel between legitimate users. The receiver succeeds by either decoding accurately or correctly detecting adversarial interference. We introduce a single-letter channel condition called $U$-distribution overwritability, and show that as long as the channel does not satisfy this condition, the authentication capacity with stochastic coding is positive and equals the no-adversary channel capacity. Our encoding scheme relies on authentication tags that allow verifying the correctness of a message that has already been received. We provide multi-letter extensions of $U$-distribution overwritability and show that the infinite letter limit yields exact characterization for positivity of authentication capacity. Noting that this characterization may, in general, be uncomputable, we next provide a single-letter channel condition called $U$-overwritability and show that it is a sufficient condition for zero authentication capacity. When restricted to deterministic codes, we show that when the channel is not $I$-overwritable, the authentication capacity is strictly positive. Further, when the channel to the legitimate receiver is degraded with respect to the channel to the adversary, $I$-overwritability is also a sufficient condition for the deterministic authentication capacity to equal zero. Lastly, we give examples demonstrating that the various notions of overwritability presented in this paper differ from each other. Our results also show that stochastic encoders are necessary for positive authentication capacity in some cases. Illustrating this, we examine in detail a binary adversarial channel that illustrates this necessity.

cs.IT↗
arXiv2026

Entropies associated with orbits of finite groups

For many groups, parabolic subgroups arise as stabilizers of flags of sets or vector spaces; the quotients by these subgroups parametrize orbits of flags, and entropies appear as rates of exponential or superexponential growth of their cardinalities. The multiplicative "chain rules" relating these cardinalities induce, asymptotically, additive analogues for the entropies. Traditional formulas in information theory correspond to quotients of symmetric groups, a particular kind of reflection group: orbit cardinalities are multinomial coefficients, related to Shannon entropy. Quotients of general linear groups over a finite field can be treated similarly, with $q$-multinomials in place of multinomials and the Tsallis 2-entropy in place of Shannon's. Here we consider other finite reflection groups and classical groups over finite fields (split groups of Lie type). In both settings the groups are classified by Dynkin diagrams into infinite series $A_n$, $B_n$, $C_n$, $D_n$ and finitely many exceptional ones; the $A_n$ series consists of the symmetric groups (reflection case) and general linear groups (Lie case). Our treatment is uniform, based on classical invariant theory: every finite reflection group $W$ has well-defined degrees, and the product of their $q$-deformations is the Poincaré polynomial of $W$ (Solomon's formula). Quotients of Poincaré polynomials count at once the cosets of parabolic subgroups of $W$ (at $q=1$) and the points of the flag varieties $G/P$ of the corresponding algebraic groups over $\mathbb F_q$ (at a prime power $q$). The series $B_n$, $C_n$, and $D_n$, studied here from an information-theoretic perspective for the first time, are linked to new entropic functionals: a reflective entropy governing the reflection groups, and a Lie entropy governing the associated groups of Lie type; each follows a distinctive chain rule.

cs.IT↗
arXiv2026

Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels

This paper studies online power control for battery-limited point-to-point energy harvesting communications over slow block-fading channels. A linear-policy-based approximation is developed for the relative-value function in the Bellman equation of the power control problem. This approximation leads to two fundamental parameterized clipped affine policies: an optimistic policy derived from a certainty-equivalence-type approximation and a robust policy derived from worst-case analysis. For independent and identically distributed energy arrivals and channel states, two families of power control schemes are developed based on the optimistic clipped affine (OCA) and robust clipped affine (RCA) policies, respectively. The proposed adaptive RCA policy based on reinforcement learning (RCA-RL) is further extended to address four scenarios with contextual information: one-step energy lookahead, one-step channel lookahead, one-step joint energy-channel lookahead, and Markov energy arrivals. Extensive simulation results show that the proposed schemes provide a favorable tradeoff between computational complexity and performance. The adaptive RCA policy based on the maximin optimal linear-policy-slope approximation (RCA-OLA-A) and the RCA-RL scheme achieve the best overall performance, while the RCA policy based on the maximin optimal linear policy (RCA-OL) is the best-performing closed-form policy. In particular, RCA-OLA-A, RCA-RL, and the aforementioned RCA-RL extensions achieve less than 2% performance loss relative to the optimal policy across a range of scenarios, consistently outperforming the considered benchmark approaches, including generic reinforcement learning baselines. The RCA-OL policy also performs well with less than 4% performance loss.

cs.IT↗