The following pages link to Coding and Cryptography (Q5899202):
Displayed 7 items.
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- Interlace polynomials: enumeration, unimodality and connections to codes (Q968188) (← links)
- From graph states to two-graph states (Q1009039) (← links)
- Two-colorable graph states with maximal Schmidt measure (Q1017249) (← links)
- Relation between spectra of Narain CFTs and properties of associated Boolean functions (Q2682175) (← links)
- Negabent Functions in the Maiorana–McFarland Class (Q3600458) (← links)
- On Boolean Functions Which Are Bent and Negabent (Q5448556) (← links)