scientific article; zbMATH DE number 515918

MaRDI QIDQ4283429zbMATH OpenFDO

Authors Erdal Arikan

Publication date 4 April 1994

zbMATH Keywords

graph-entropy boundupper boundzero-error list coding capacity

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (05C99) Information theory (general) (94A15)

Recommendations

• An upper bound on the zero-error list-coding capacity
• Lower bound on error probability in fixed-volume list decoding
• Zero error capacity under list decoding
• Zero-error list capacities of discrete memoryless channels
• Zero Error List-Decoding Capacity of the q/(q–1) Channel

Cited in

(7)

• New bounds for perfect \(k\)-hashing
• Zero error capacity under list decoding
• An upper bound on the zero-error list-coding capacity
• Zero-error list capacities of discrete memoryless channels
• Erasure, list, and detection zero-error capacities for low noise and a relation to identification
• An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel
• Zero Error List-Decoding Capacity of the q/(q–1) Channel

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4283429)