An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel

DOI10.1109/TIT.2019.2933424MaRDI QIDQ5211632zbMATH OpenOpenAlexFDO

Authors Marco Dalai, Venkatesan Guruswami, Jaikumar Radhakrishnan

Publication date 28 January 2020

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

Full work available at URL https://doi.org/10.1109/tit.2019.2933424

Mathematics Subject Classification ID

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

Recommendations

• Bounds on the Zero-Error List-Decoding Capacity of the q/(q – 1) Channel
• scientific article; zbMATH DE number 515918
• An upper bound on the zero-error list-coding capacity
• Zero Error List-Decoding Capacity of the q/(q–1) Channel
• New lower bounds on the fraction of correctable errors under list decoding in combinatorial binary communication channels
• Improved lower bounds on the sizes of error-correcting codes for list decoding
• Zero error capacity under list decoding
• Zero-error list capacities of discrete memoryless channels
• Lower bound on error probability in fixed-volume list decoding
• Explicit list-decodable codes with optimal rate for computationally bounded channels

Cited in

(3)

• New bounds for perfect \(k\)-hashing
• 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 Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel

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