Lower bounds in the capacity of permutation channels
- 1 March 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 17 (2), 134-140
- https://doi.org/10.1109/tit.1971.1054610
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Rank permutation group codes based on Kendall's correlation statisticIEEE Transactions on Information Theory, 1969
- A Contribution to the Multiple-Polarity Coincidence Detection SchemesIEEE Transactions on Communications, 1968
- Suboptimum Rank Detection Procedures Using Rank Vector CodesIEEE Transactions on Communications, 1968
- The asymptotic relative efficiency of mixed statistical testsIEEE Transactions on Information Theory, 1967
- A simple derivation of the coding theorem and some applicationsIEEE Transactions on Information Theory, 1965
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952
- A NOTE ON THE CUMULANTS OF KENDALL'S S-DISTRIBUTIONBiometrika, 1950