메뉴 건너뛰기




Volumn , Issue , 2012, Pages 351-358

Subspace evasive sets

Author keywords

affine varieties; list decodable codes; pseudo randomness

Indexed keywords

AFFINE VARIETIES; LIST-DECODABLE CODES; OPTIMAL RATE; PSEUDORANDOMNESS;

EID: 84862590740     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214010     Document Type: Conference Paper
Times cited : (77)

References (10)
  • 2
    • 0000167385 scopus 로고
    • Solving zero-dimensional algebraic systems
    • D. and Lazard. Solving zero-dimensional algebraic systems. Journal of Symbolic Computation, 13(2):117-131, 1992.
    • (1992) Journal of Symbolic Computation , vol.13 , Issue.2 , pp. 117-131
    • Lazard, D.1
  • 3
    • 25944479355 scopus 로고
    • Efficient computation of zero-dimensional gröbner bases by change of ordering
    • October
    • J. C. Faugère, P. Gianni, D. Lazard, and T. Mora. Efficient computation of zero-dimensional gröbner bases by change of ordering. J. Symb. Comput., 16:329-344, October 1993.
    • (1993) J. Symb. Comput. , vol.16 , pp. 329-344
    • Faugère, J.C.1    Gianni, P.2    Lazard, D.3    Mora, T.4
  • 4
    • 80052004403 scopus 로고    scopus 로고
    • Linear-algebraic list decoding of folded reed-solomon codes
    • V. Guruswami. Linear-algebraic list decoding of folded reed-solomon codes. In IEEE Conference on Computational Complexity, pages 77-85, 2011.
    • (2011) IEEE Conference on Computational Complexity , pp. 77-85
    • Guruswami, V.1
  • 5
    • 38349146703 scopus 로고    scopus 로고
    • Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy
    • V. Guruswami and A. Rudra. Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy. Information Theory, IEEE Transactions on, 54(1):135 -150, 2008.
    • (2008) Information Theory, IEEE Transactions on , vol.54 , Issue.1 , pp. 135-150
    • Guruswami, V.1    Rudra, A.2
  • 6
    • 80052389088 scopus 로고    scopus 로고
    • Optimal rate list decoding via derivative codes
    • V. Guruswami and C. Wang. Optimal rate list decoding via derivative codes. In APPROX-RANDOM, pages 593-604, 2011.
    • (2011) APPROX-RANDOM , pp. 593-604
    • Guruswami, V.1    Wang, C.2
  • 8
    • 33750330247 scopus 로고    scopus 로고
    • Pseudorandom sets and explicit construction of Ramsey graphs
    • P. Pudlák and V. Rödl. Pseudorandom sets and explicit construction of Ramsey graphs. Quaderni di Matematica, 13:327-346, 2004.
    • (2004) Quaderni di Matematica , vol.13 , pp. 327-346
    • Pudlák, P.1    Rödl, V.2
  • 9
    • 51249166721 scopus 로고
    • On the affine bezout inequality
    • J. Schmid. On the affine bezout inequality. Manuscripta Mathematica, 88(1):225-232, 1995.
    • (1995) Manuscripta Mathematica , vol.88 , Issue.1 , pp. 225-232
    • Schmid, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.