Coding and Cryptography

DOI10.1007/11779360MaRDI QIDQ5899202zbMATH OpenOpenAlexFDO

Authors 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 (05C99) Graph theory (including graph drawing) in computer science (68R10) Quantum measurement theory, state operations, state preparations (81P15) Cryptography (94A60) Combinatorial codes (94B25)

Recommendations

• The interlace polynomial of a graph
• A two-variable interlace polynomial
• Interlace polynomials
• Publication:4952623
• Interlace polynomials: enumeration, unimodality and connections to codes

Cited in

(8)

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

This page was built for publication: Coding and Cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899202)