Construction of self dual codes from graphs

DOI10.1007/S00200-022-00567-2MaRDI QIDQ6568919

Nazahet Fellah, Kenza Guenda, Ferruh Özbudak, Padmapani Seneviratne

Publication date: 8 July 2024

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

Hadamard matricesself-dual codesextremal doubly even codesPaley-type bipartite graphs

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Codes from incidence matrices and line graphs of Paley graphs
• Self-orthogonal designs and extremal doubly even codes
• Quadratic double circulant codes over fields
• Statistical properties of side-channel and fault injection attacks using coding theory
• Self-dual codes and orthogonal matrices over large finite fields
• New doubly even self-dual codes having minimum weight 20
• A classification of self-orthogonal codes over GF(2)
• On orthogonal matrices.
• Bemerkungen über die Verteilung der quadratischen Reste
• A new upper bound on the minimal distance of self-dual codes
• Extremal binary self-dual codes
• Shadow bounds for self-dual codes
• An upper bound for self-dual codes
• A Characteristic Property of Quadratic Residues
• Certain theorems in the theory of quadratic residues.

This page was built for publication: Construction of self dual codes from graphs

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