Entropy of a bit-shift channel

Dee Denteneer; Evgeny Verbitskiy; Henk Hollmann; Ludo Tolhuizen; Sebastian Egner; Stan Baggen; Vladimir Balakirsky

REVIEW

Entropy of a bit-shift channel

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 math/0608254 v1 pith:7IDFVXTJ submitted 2006-08-10 math.DS

Stan Baggen , Vladimir Balakirsky , Dee Denteneer , Sebastian Egner , Henk Hollmann , Ludo Tolhuizen , Evgeny Verbitskiy This is my paper · ORCID

classification math.DS

keywords bit-shiftchannelentropyprocesssimpletransformationcalledcoding

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

We consider a simple transformation (coding) of an iid source called a bit-shift channel. This simple transformation occurs naturally in magnetic or optical data storage. The resulting process is not Markov of any order. We discuss methods of computing the entropy of the transformed process, and study some of its properties.

Discussion (0). Continue with ORCID to comment.

Pith tools