An upper bound on the zero-error list-coding capacity

DOI10.1109/18.335947MaRDI QIDQ4324191zbMATH OpenOpenAlexFDO

Authors Erdal Arikan

Publication date 1 March 1995

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/13611

zbMATH Keywords

boundgraph-entropylist-coding capacityperfect-hashingShannon capacity of graphszero-error capacity

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• scientific article; zbMATH DE number 515918
• Channel capacity for a given decoding metric
• Zero error capacity under list decoding
• Zero-error list capacities of discrete memoryless channels
• List decoding

Cited in

(16)

• Beating Fredman-Komlós for perfect \(k\)-hashing
• New bounds for perfect \(k\)-hashing
• scientific article; zbMATH DE number 4039791 (Why is no real title available?)
• Zero error capacity under list decoding
• scientific article; zbMATH DE number 515918 (Why is no real title available?)
• Bounds on the zero-error capacity of the input-constrained bit-shift channel
• Zero-error list capacities of discrete memoryless channels
• Channel capacity for a given decoding metric
• Erasure, list, and detection zero-error capacities for low noise and a relation to identification
• Beating Fredman-Komlós for Perfect k-Hashing.
• 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
• Recursive bounds for perfect hashing
• Trifferent codes with small lengths
• The maximum cardinality of trifferent codes with lengths 5 and 6
• Improved upper bound for the size of a trifferent code

This page was built for publication: An upper bound on the zero-error list-coding capacity

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