Uniqueness of codes using semidefinite programming

DOI10.1007/s10623-018-0589-8zbMath1409.94948arXiv1709.02195OpenAlexW3098548222WikidataQ90352983 ScholiaQ90352983MaRDI QIDQ1999906

Andries E. Brouwer, Sven C. Polak

Publication date: 27 June 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.02195

zbMATH Keywords

uniquenesssemidefinite programmingcodebinary codegolay

Mathematics Subject Classification ID

Semidefinite programming (90C22) Other designs, configurations (05B30) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items

code_uniqueness

Uses Software

• nauty
• Traces
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniqueness of some linear subcodes of the extended binary Golay code
• Semidefinite bounds for nonbinary codes based on quadruples
• Practical graph isomorphism. II.
• A classification of self-orthogonal codes over GF(2)
• Latest Developments in the SDPA Family for Solving Large-Scale SDPs
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• Semidefinite Programming Bounds for Constant-Weight Codes
• Semidefinite Code Bounds Based on Quadruple Distances
• On the classification and enumeration of self-dual codes