A new sieve for distinct coordinate counting
Articles
First Online:
Received:
Accepted:
- 52 Downloads
- 11 Citations
Abstract
We present a new sieve for the distinct coordinate counting problem. This significantly improves the classical inclusion-exclusion sieve for this problem, in the sense that the number of terms is reduced from \( 2^{(_2^k )} \) to k!, and reduced further to p(k) in the symmetric case, where p(k) denotes the number of partitions of k. As an illustration of applications, we give an in-depth study of a basic example arising from coding theory and graph theory.
Keywords
sieve distinct coordinate countingMSC(2000)
05A15 11T24Preview
Unable to display preview. Download preview PDF.
References
- 1.Cheng Q, Murray E. On deciding deep holes of Reed-Solomon codes. In: TAMC 2007, Lecture Notes in Computer Science, vol. 4484. Berlin-Heidelberg: Springer, 2007Google Scholar
- 2.Cheng Q, Wan D. On the list and bounded distance decodibility of Reed-Solomon codes. In: FOCS (2004). 45th Annual IEEE Symposium on Foundation of Computer Science. Rome: IEEE Computer Society Press, 2004, 335–341CrossRefGoogle Scholar
- 3.Cheng Q, Wan D. On the list and bounded distance decodability of Reed-Solomon codes. SIAM J Comput, 2007, 37: 195–209MATHCrossRefMathSciNetGoogle Scholar
- 4.Cheng Q, Wan D. Complexity of decoding positive-rate Reed-Solomon codes. In: Proceedings of ICALP08, Lecture Notes in Computer Sciences, vol. 5125. Berlin-Heidelberg: Springer, 2008, 283–293Google Scholar
- 5.Cheng Q, Wan D. A deterministic reduction for the gap minimun distance problem. In: STOC 2009, 41st ACM Symposium on Theory of Computing. New York: ACM Press, 2009, 33–38CrossRefGoogle Scholar
- 6.Chung F. Diameters and eigenvalues. J Amer Math Soc, 1989, 2: 187–196MATHMathSciNetGoogle Scholar
- 7.Cohen S D. Polynomial factorization and an application to regular directed graphs. Finite Fields Appl, 1998, 4: 316–346MATHCrossRefMathSciNetGoogle Scholar
- 8.Katz N. Facoring polynomials in finite fields: an application of Lang-Weil to a problem in graph theory. Math Ann, 1990, 286: 625–637MATHCrossRefMathSciNetGoogle Scholar
- 9.Li J Y, Wan D. On the subset sum problem over finite fields. Finite Fields Appl, 2008, 14: 911–929MATHCrossRefMathSciNetGoogle Scholar
- 10.Li Y J, Wan D. On error distance of Reed-Solomon codes. Sci China Ser A, 2008, 51: 1982–1988MATHCrossRefMathSciNetGoogle Scholar
- 11.Stanley R P. Enumerative Combinatorics, vol. 1. Cambridge: Cambridge University Press, 1997MATHGoogle Scholar
- 12.Wan D. Generators and irreducible polynomials over finite fields. Math Comp, 1997, 66: 1195–1212MATHCrossRefMathSciNetGoogle Scholar
- 13.Wang Y. Wang Yuan Selected Papers (in Chinese). Changsha: Hunan Education Press, 1999Google Scholar
Copyright information
© Science China Press and Springer-Verlag Berlin Heidelberg 2010