article · IEEE Transactions on Information Theory · 1994
Some notes on Varn coding
Cited by 24Abstract and details only
Abstract
A duality between Varn (1971) coding and Tunstall (1968) coding is demonstrated and new bounds on the expected transmission cost per source symbol for Varn codes are established. For binary channels, the superiority of the new upper bound over Krause's (1962) upper bound is proven.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite this paper
Savari, S. A. (1994). Some notes on Varn coding. IEEE Transactions on Information Theory, 40(1), 181–186. https://doi.org/10.1109/18.272477
Savari, Serap A. “Some notes on Varn coding.” IEEE Transactions on Information Theory, vol. 40, no. 1, 1994, pp. 181–86, https://doi.org/10.1109/18.272477.
Savari, Serap A. 1994. “Some notes on Varn coding.” IEEE Transactions on Information Theory 40 (1): 181–86. https://doi.org/10.1109/18.272477.
Savari, S.A. (1994) ‘Some notes on Varn coding’, IEEE Transactions on Information Theory, 40(1), pp. 181–186. Available at: https://doi.org/10.1109/18.272477.
@article{savari1994some,
title = {{Some notes on Varn coding}},
author = {Savari, Serap A.},
journal = {IEEE Transactions on Information Theory},
volume = {40},
number = {1},
pages = {181--186},
year = {1994},
doi = {10.1109/18.272477}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.