Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/5498
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMaitra, Subhamoy-
dc.contributor.authorSarkar, Palash-
dc.date.accessioned2013-06-21T09:53:00Z-
dc.date.available2013-06-21T09:53:00Z-
dc.date.issued1999-08-27-
dc.identifier.citationInformation Processing Letters,v.71, no. 3–4,p.149–153en_US
dc.identifier.urihttp://hdl.handle.net/10263/5498-
dc.language.isoenen_US
dc.subjectCombinatorial problemsen_US
dc.subjectCryptographyen_US
dc.subjectCorrelation immunityen_US
dc.subjectBoolean functionsen_US
dc.subjectBipartite graphen_US
dc.titleHamming weights of correlation immune boolean functionsen_US
dc.typeArticleen_US
Appears in Collections:Computer Science

Files in This Item:
File Description SizeFormat 
IPL-71-1999-P149-153.pdf294.74 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.