Skip to Main Content Area
  • CPS-VO
    • Contact Support
  • Browse
    • Calendar
    • Announcements
    • Repositories
    • Groups
  • Search
    • Search for Content
    • Search for a Group
    • Search for People
    • Search for a Project
    • Tagcloud
      
 
Not a member?
Click here to register!
Forgot username or password?
 
Home
National Science Foundation

Cyber-Physical Systems Virtual Organization

Read-only archive of site from September 29, 2023.

CPS-VO

Transforms

biblio

Visible to the public Constructing Boolean functions with potentially optimal algebraic immunity based on additive decompositions of finite fields (extended abstract)

Submitted by BrandonB on Thu, 04/30/2015 - 12:49pm
  • Electronic mail
  • unbalanced functions
  • Transforms
  • optimal algebraic degree
  • information theory
  • generalized Tu-Deng functions
  • finite field
  • fast algebraic attacks
  • FAA
  • additive decomposition
  • Cryptography
  • cryptographic significant Boolean functions
  • combinatorial mathematics
  • combinatorial conjecture
  • Boolean functions
  • binary strings
  • algebraic immunity
  • Additives
biblio

Visible to the public Network Codes Resilient to Jamming and Eavesdropping

Submitted by BrandonB on Thu, 04/30/2015 - 12:45pm
  • network capacity
  • Vectors
  • Transforms
  • source rate
  • secrecy
  • Robustness
  • rate-optimal
  • random linear network coding
  • random codes
  • polynomial-time distributed network codes
  • network coding
  • Achievable rates
  • malicious errors
  • linear codes
  • Jamming
  • interior nodes
  • error probability
  • error control
  • eavesdropping
  • communicating information
  • communicated message
  • adversary
  • « first
  • ‹ previous
  • …
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10

Terms of Use  |  ©2023. CPS-VO