The neighbor graph of linear codes over finite fields

DOI10.1016/J.DISC.2026.115310MaRDI QIDQ7326045zbMATH OpenFDO

Authors Steven T. Dougherty, Esengül Saltürk

Publication date 8 September 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115310

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Cites work

• Binary self-dual codes of various lengths with new weight enumerators from a modified bordered construction and neighbours
• Constructions of self-dual codes over finite commutative chain rings
• scientific article; zbMATH DE number 691484 (Why is no real title available?)
• New extremal binary self-dual codes of length 68 from generalized neighbors
• New extremal self-dual binary codes of length 68 via composite construction, \( \mathbb{F}_2 + u \mathbb{F}_2\) lifts, extensions and neighbours
• On the Dimension of the Hull
• On the uniqueness of the Golay codes
• Self-dual codes over commutative Frobenius rings
• Shadow codes and weight enumerators
• Shadow codes over \({\mathbb Z}_4\)
• Shadow lattices and shadow codes
• The neighbor graph of binary self-dual codes
• The neighbor graph of binary self-orthogonal codes

This page was built for publication: The neighbor graph of linear codes over finite fields

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