On asymptotics of certain sums arising in coding theory

@article{Szpankowski1995OnAO,
  title={On asymptotics of certain sums arising in coding theory},
  author={Wojciech Szpankowski},
  journal={IEEE Trans. Information Theory},
  year={1995},
  volume={41},
  pages={2087-2090}
}
Recently, T. J(lpve [IEEE IT, 41, jOg51 analyzed the average worst case probability of undetected error for linear [n, k; q] codes of length n and dimension k over an alphabet of si7,c q. The following sum 5 n = I:i:=:l (7Hi/n)i(li/n)n-i arose, which has also some other applkations in codlng theory, average case analysis of algorithms, and combinatorics. T. IG!ilve conjectured an asymptotic expansion of this sum, and we prove its enhcnced version in lms note. Furthermore, we consider a more… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS
12 Citations
16 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 16 references

ve, Bounds for the Worst Case Probability of Undetected Error

  • T. Kl
  • IEEE Information Theory,
  • 1995
3 Excerpts

Expected Deadlock Time in a Multiprocessor System

  • K. Compton, C. Ravishankar
  • INRIA TR-1997,
  • 1992

Similar Papers

Loading similar papers…