A New Lower Bound for Noisy Permutation Channels via Divergence Packing.

Lugaoze Feng, Guocheng Lv, Xunan Li, Ye Jin

Abstract read

In one paragraph

Article in Entropy (Basel, Switzerland), 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it

0cells of the map it votes in

0citing papers in PubMed

–field-weighted citation impact

1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Lugaoze FengState Key Laboratory of Photonics and Communications, Peking University, Beijing 100871, China.ORCID 0009-0000-4014-4154

Guocheng LvState Key Laboratory of Photonics and Communications, Peking University, Beijing 100871, China.ORCID 0000-0002-7136-3402

Xunan LiNational Computer Network Emergency Response Technical Team/Coordination Center of China, Beijing 100029, China.ORCID 0000-0002-5740-161X

Ye JinState Key Laboratory of Photonics and Communications, Peking University, Beijing 100871, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Noisy permutation channels are applied in modeling biological storage systems and communication networks. For noisy permutation channels with strictly positive and full-rank square matrices, new achievability bounds are given in this paper, which are tighter than existing bounds. To derive this bound, we use the ϵ-packing with Kullback-Leibler divergence as a distance and introduce a novel way to illustrate the overlapping relationship of error events. This new bound shows analytically that for such a matrix

Indexed as

divergence packingfinite blocklengthnoisy permutation channelϵ-packing

Identifiers

PMID41294944

DOI10.3390/e27111101

PMCPMC12650953

What OpenQuestion holds

Textmetadata

LicenceCC BY

Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.