메뉴 건너뛰기




Volumn 8, Issue 3, 1995, Pages 167-173

An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions

Author keywords

Error correcting code; Orthogonal array; Resilient function

Indexed keywords

CODES (SYMBOLS); ERROR CORRECTION; FUNCTIONS; NONLINEAR EQUATIONS; NUMERICAL METHODS;

EID: 0029327136     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/BF00202271     Document Type: Article
Times cited : (47)

References (13)
  • 4
    • 84950371844 scopus 로고    scopus 로고
    • B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich, and R. Smolensky. The bit extraction problem or t-resilient functions. Proc. 26th IEEE Symp. on Foundations of Computer Science, 1985, pp. 396–407.
  • 5
    • 84950371845 scopus 로고    scopus 로고
    • P. Delsarte. An Algebraic Approach to the Association Schemes of Coding Theory. Philips Research Reports Supplements, vol. 10, 1973.
  • 7
    • 85025844274 scopus 로고    scopus 로고
    • K. Gopalakrishnan and D. R. Stinson. Three characterizations of non-binary correlationimmune and resilient functions. Designs Codes Cryptography, to appear.
  • 10
    • 85025849576 scopus 로고    scopus 로고
    • U. M. Maurer and J. L. Massey. Local randomness in pseudorandom sequences. J. Cryptology b (1991), 135–149.


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