An upper bound on the zero-error list-coding capacity
Author:
- E. ArikanEAE. Arikan
- 1 July 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (4) , 1237-1240
Abstract
Cataloged from PDF version of article.We present an upper bound on the zero-error list-coding\ud capacity of discrete memoryless channels. Using this bound, we show\ud that the list3 capacity of the 4/3 channel is at most 03512 b,\ud improving the best previous bound. The relatien of the bound to earlier\ud similar bouads, in particular, to Korner's graph+ntropy bound, is\ud discussedKeywords
This publication has 7 references indexed in Scilit:
- An improved graph-entropy bound for perfect hashing1994
- On the capacity of uniform hypergraphsIEEE Transactions on Information Theory, 1990
- New Bounds for Perfect Hashing via Information TheoryEuropean Journal of Combinatorics, 1988
- Zero error capacity under list decodingIEEE Transactions on Information Theory, 1988
- Fredman–Komlós bounds and information theorySIAM Journal on Algebraic Discrete Methods, 1986
- On the Size of Separating Systems and Families of Perfect Hash FunctionsSIAM Journal on Algebraic Discrete Methods, 1984
- The zero error capacity of a noisy channelIEEE Transactions on Information Theory, 1956