Pith Number

pith:OGUNPBKA

pith:2025:OGUNPBKA4YHH6JAG6UUBPEJSOZ

not attested not anchored not stored refs pending

Design and Analysis of a Concatenated Code for Intersymbol Interference Wiretap Channels

Aria Nouri, Jun Chen, Reza Asvadi

A concatenated LDPC-trellis scheme achieves tight lower bounds on secrecy capacity for ISI wiretap channels while driving the leakage upper bound to zero.

arxiv:2501.07561 v5 · 2025-01-13 · cs.IT · math.IT

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{OGUNPBKA4YHH6JAG6UUBPEJSOZ}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

The proposed concatenated coding scheme achieves tight lower bounds on the secrecy capacity of ISI wiretap channels and drives the estimated upper bound on the information leakage rate to zero by optimizing degree distributions of the irregular LDPC codes at the outer stage.

C2weakest assumption

The trellis code can be designed to transform uniformly distributed LDPC codewords into a Markov process that achieves tight lower bounds on secrecy capacity without introducing additional rate loss or secrecy degradation, as motivated by the theoretical codes that achieve secrecy capacity.

C3one line summary

A concatenated LDPC-trellis coding scheme is proposed for ISI wiretap channels that establishes secrecy capacity, achieves tight lower bounds via Markov transformation, and optimizes LDPC degrees to drive leakage upper bound to zero.

Receipt and verification

First computed	2026-06-10T01:08:26.911861Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

71a8d78540e60e7f2406f528179132764ab3d1faf2d2f9933733173ae5109909

Aliases

arxiv: 2501.07561 · arxiv_version: 2501.07561v5 · doi: 10.48550/arxiv.2501.07561 · pith_short_12: OGUNPBKA4YHH · pith_short_16: OGUNPBKA4YHH6JAG · pith_short_8: OGUNPBKA

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/OGUNPBKA4YHH6JAG6UUBPEJSOZ \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 71a8d78540e60e7f2406f528179132764ab3d1faf2d2f9933733173ae5109909

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "a084f9413157da5c0f274acb8fadddd94c8e3c568c6cebe6e7f6ac2cc68636c2",
    "cross_cats_sorted": [
      "math.IT"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.IT",
    "submitted_at": "2025-01-13T18:51:46Z",
    "title_canon_sha256": "af6c7bbf4bee8c953b0ee704932ebbc9d00d392ffac8a30d06d04019e5cd57b8"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2501.07561",
    "kind": "arxiv",
    "version": 5
  }
}