scientific article; zbMATH DE number 7352046

zbMath1495.94113MaRDI QIDQ4990142

Sudipta Mallik, Bahattin Yildiz

Publication date: 28 May 2021

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/79/ajc_v79_p515.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hamming distanceminimum distance of codes

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Linear codes (general theory) (94B05) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items

A new formula for the minimum distance of an expander code

Cites Work

• Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
• A characterization of graphs by codes from their incidence matrices
• Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs
• \(LCD\) codes from adjacency matrices of graphs
• Binary codes from the complements of the triangular graphs
• Codes on Graphs: Fundamentals
• Is code equivalence easy to decide?
• The intractability of computing the minimum distance of a code
• The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography
• Introduction to Coding Theory

This page was built for publication: