Correction to "The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds"

Neri Merhav

Correction to "The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds"

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1707.03987 v1 pith:6W7YNYUE submitted 2017-07-13 cs.IT math.IT

Neri Merhav This is my paper · ORCID

classification cs.ITmath.IT

keywords boundscodingdecoderexpurgatedgeneralizedlikelihoodrandomstochastic

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

This purpose of this letter is to handle a gap that was found in the proof of Theorem 2 in the paper "The generalized stochastic likelihood decoder: random coding and expurgated bounds."

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

A Lagrange-Dual Lower Bound to the Error Exponent Function of the Typical Random Code
cs.IT 2019-08 conditional novelty 6.0 of 10

A five-parameter Lagrange-dual lower bound is derived for the typical random code error exponent for i.i.d. ensembles and mismatched likelihood decoding.

Pith tools