Coding and Cryptography

DOI10.1007/11779360zbMath1151.94563OpenAlexW2504517155MaRDI QIDQ5899202

Constanza Riera, Matthew G. Parker

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11779360

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Quantum measurement theory, state operations, state preparations (81P15) Graph theory (05C99) Combinatorial codes (94B25)

Related Items (7)

Relation between spectra of Narain CFTs and properties of associated Boolean functions ⋮ Fast evaluation of interlace polynomials on graphs of bounded treewidth ⋮ Interlace polynomials: enumeration, unimodality and connections to codes ⋮ Negabent Functions in the Maiorana–McFarland Class ⋮ On Boolean Functions Which Are Bent and Negabent ⋮ From graph states to two-graph states ⋮ Two-colorable graph states with maximal Schmidt measure

This page was built for publication: Coding and Cryptography