Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.19852

Global and Local Entropy Tests for STL Files Under IEEE-754 Validity Constraints

Tonislav Troev·Borislav Stoyanov
View original source ↗Read source document ↗Export metadata ↓

Abstract

Shannon entropy is a standard measure of ciphertext randomness, evaluated either globally over the byte histogram of the entire ciphertext or locally as the average over non-overlapping blocks of ?xed size. While the global statistic captures only the overall byte distribution, the local statistic is also sensitive to non-randomness that is con?ned to parts of the ciphertext. Both measures are commonly assessed against reference values derived under the assumption of independent uniform bytes. However, STL encodes most numerical data as single-precision IEEE-754 ?oats, and format validity requires them to be ?nite, causing nonuniform byte probabilities and dependence between the two bytes of each exponent pair. We derive the exact mean and variance of entropy under the valid-STL (VSTL) distribution, which assigns equal probability to every admissible sequence of triangle records, and provide second-order expansions that keep the global reference values practical to compute at large ?le sizes. Using these expansions, we establish a two-sided hypothesis test for the global entropy statistic, whose limiting value is lowered from 8 to 7.99991479609 bits. The format constraints also change the local entropy reference: applying the capacity energy criterion to triangle records selects a block size of 1950 bytes instead of 1936 bytes, with an exact reference mean of 7.903106732975 rather than 7.902469316647 bits. Although small, these shifts are su?cient to place the VSTL reference means outside the conventional 95% acceptance intervals at practical ?le sizes, making unadjusted entropy tests prone to falsely rejecting ideal VSTL ciphertexts. Monte-Carlo simulations con?rm all reference values within sampling error. We therefore recommend using the format-speci?c reference values derived here to evaluate STL ciphers.

Explore related subjects

cs.ITcs.CRmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tonislav Troev, Borislav Stoyanov. 2026-10-14. Global and Local Entropy Tests for STL Files Under IEEE-754 Validity Constraints. https://arxiv.org/abs/2610.19852

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

KEEP EXPLORING

Related papers

arXiv2026

Performance Analysis of Pinching Antenna Systems Enabled NOMA Communications

Pinching antenna systems (PASS) have the advantages in the perspective of flexible antenna reconfiguration, line-of-sight (LoS) creation, and scalability features. To highlight the ascendancy of PASS, we survey the integration of PASS into non-orthogonal multiple access (NOMA) networks. The locations of nodes are randomly distributed within a circular coverage region. The influencing factors of LoS and none-line-of-sight (NLoS) propagation links from PASS to non-orthogonal nodes are taken into consideration. To characterize performance of PASS-NOMA, we deduce the outage probability and ergodic data rates expressions of two nodes over LoS/NLoS fading channels. In light of these theoretical results, the formally unbounded diversity gains are also characterized with node n under ideal successive interference cancellation (ISIC) and node f over LoS links, when the SNR exceeds a finite threshold. The slopes of ergodic data rate for node n with ISIC equals to one and that of node f presents a zero slope. In addition, the PASS-NOMA system throughput are evaluated in different transmission modes. It is shown from the numerical results that: 1) The outage behaviors of PASS-NOMA networks under LoS/NLoS conditions outperform that of PASS aided orthogonal multiple access (OMA) networks and that of conventional antenna systems (CASS) aided OMA/NOMA networks; 2) The employment of PASS enables the larger ergodic data rates relative to PASS-OMA and CASS-OMA/NOMA networks; and 3) As the quantity of communication radius and PASS' height rises, the performance of PASS-NOMA networks are declined at a certain extent.

cs.IT↗
arXiv2026

Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel

This work extends the generalized nearest neighbor decoding (GNND), originally developed as a receiver architecture for memoryless channels, to a vectorized GNND (Vec-GNND) suitable for in-block memory (IBM) channels. Leveraging the generalized mutual information (GMI) as an operational lower bound on the mismatch capacity, an analytical characterization of the optimal Vec-GNND is obtained for general IBM channels with Gaussian codebooks. The formalism further provides closed-form optimality conditions and achievable GMIs for restricted variants of the receiver architecture. Furthermore, we formulate a GMI-based joint design viewpoint for Gaussian codebook covariance and decoding metrics. Since the metric optimization admits a closed-form solution for each fixed covariance, the joint design is reduced to an input-covariance optimization problem; for the diagonal covariance family, we derive first-order self-consistent optimality conditions. Numerical evaluations on block noncoherent AWGN and phase-noise channels demonstrate consistent GMI gains over conventional scaling-based GNND schemes, suggesting potential performance advantages of Vec-GNNDR in practical communication systems.

cs.IT↗
arXiv2026

Hermitian Hulls of Cyclic Codes and Exact Dual Distances of Extended Linear Codes

Let $\mathcal{C}$ be an $[n,k,d]$ linear code over $\F_{q^2}$ with parity-check matrix $H$. The rank $r=\Rank(HH^{\dagger})$ measures how far the Hermitian dual $\mathcal{C}^{\perp_h}$ is from being Hermitian self-orthogonal, and it is the least number of coordinates that must be adjoined to $\mathcal{C}^{\perp_h}$ to make it Hermitian self-orthogonal; equivalently, the Hermitian hull $\mathcal{C}\cap\mathcal{C}^{\perp_h}$ has dimension $(n-k)-r$. In this paper, we develop a structure theory of the Hermitian hull of a cyclic code and apply it to the construction of quantum stabilizer codes. For a cyclic code with defining set $T\subseteq\mathbb{Z}_n$, we show that $r$ is additive over the orbits of the involution $τ(ν)=-qν$ on the $q^2$-cyclotomic cosets and satisfies a parity constraint. A parameter dictionary exhibits $r$ as a gauge trading one-for-one against the code length, and a complementation duality shows that the complement of $T$ realises the logical-qubit count of the quantum code. The extreme values of $r$ are settled by closed subset-sum criteria, and the $τ$-invariant defining sets are shown to be the unique locus on which the Hermitian dual is again cyclic. On the distance side, we determine the Hermitian dual distance of an $r$-fold extension of an arbitrary linear code exactly, and we prove that the admissible extension vectors lie in the image of $HH^{\dagger}$, which reduces the search space from $q^{2(n-k)}$ to $q^{2r}$. Applied to cyclic, quasi-cyclic and BCH codes, the construction improves $23$ best-known parameters in Grassl's code tables, one of them provably optimal.

cs.IT↗