Verifying the smallest interesting colour code with quantomatic

Garvie, Liam and Duncan, Ross (2018) Verifying the smallest interesting colour code with quantomatic. Electronic Proceedings in Theoretical Computer Science, EPTCS, 266. pp. 147-163. ISSN 2075-2180 (https://doi.org/10.4204/EPTCS.266.10)

Preview

Text. Filename: Garvie_Duncan_EPTCS_2017_Verifying_the_smallest_interesting_colour_code_with_quantomatic.pdf Final Published Version License: Download (565kB)| Preview

Abstract

In this paper we present a Quantomatic case study, verifying the basic properties of the Smallest Interesting Colour Code error detection code.

• Share and Export
  

  RDF+XMLBibTeXRIOXX2 XMLRDF+N-TriplesJSONDublin CoreAtomSimple MetadataReferMETSHTML CitationASCII CitationOpenURL ContextObjectEndNoteOpenURL ContextObject in SpanMODSMPEG-21 DIDLEP3 XMLData Cite XMLRIS (EndNote Online, Zotero, Ref manager, etc)RDF+N3Multiline CSV
• Item metadata

  Item type:	Article
  ID code:	64967
  Dates:	Date Event 27 February 2018 Published 29 May 2017 Accepted
  Subjects:	Science > Mathematics > Electronic computers. Computer science
  Department:	Faculty of Science > Computer and Information Sciences
  Depositing user:	Pure Administrator
  Date deposited:	01 Aug 2018 14:30
  Last modified:	14 Apr 2024 00:46
  Related URLs:	Scopus publication Related item Journal or Publication
  URI:	https://strathprints.strath.ac.uk/id/eprint/64967