The neighbor graph of binary self-dual codes

DOI10.1007/S10623-021-00985-2zbMATH Open1485.94154OpenAlexW4207031357WikidataQ114849837 ScholiaQ114849837MaRDI QIDQ2115725FDOQ2115725

Steven T. Dougherty

Publication date: 21 March 2022

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

Full work available at URL: https://doi.org/10.1007/s10623-021-00985-2

Recommendations

• Isodual and self-dual codes from graphs
• scientific article; zbMATH DE number 1028232
• Permutation decoding for binary self-dual codes from the graph \(Q_n\) where \(n\) is even
• Constructing self-dual codes using graphs
• Type I neighbors of extremal Type II codes of length 40 derived from Hadamard matrices

zbMATH Keywords

graphself-dual codestype II codeneighbor code

Mathematics Subject Classification ID

Applications of graph theory (05C90) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Cites Work

• Fundamentals of Error-Correcting Codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new upper bound on the minimal distance of self-dual codes
• Self-dual codes and invariant theory
• Title not available (Why is that?)
• Extremal binary self-dual codes
• The Search for a Finite Projective Plane of Order 10
• Algebraic Coding Theory Over Finite Commutative Rings

Cited In (2)

• Title not available (Why is that?)
• New type I binary \([72, 36, 12]\) self-dual codes from \(M_6(\mathbb{F}_2)G\) -- group matrix rings by a hybrid search technique based on a neighbourhood-virus optimisation algorithm

This page was built for publication: The neighbor graph of binary self-dual codes

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