Construction of linear codes from the unit graph \(G(\mathbb{Z}_n)\)

DOI10.1142/s1793557123502133MaRDI QIDQ6650923

B. Surendranath Reddy, Wajid M. Shaikh, Rupali Shikharchand Jain

Publication date: 9 December 2024

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

incidence matrixlinear codesminimum distanceunit graphdual code

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Codes from incidence matrices and line graphs of Paley graphs
• Codes from lattice and related graphs, and permutation decoding
• Codes associated with triangular graphs and permutation decoding
• Codes from incidence matrices and line graphs of Hamming graphs
• \(LCD\) codes from adjacency matrices of graphs
• Error-correcting codes from graphs
• Codes from incidence matrices of graphs
• Unit Graphs Associated with Rings
• ON THE GIRTH OF THE UNIT GRAPH OF A RING
• A Graph-Theoretic Approach to a Communications Problem

This page was built for publication: Construction of linear codes from the unit graph \(G(\mathbb{Z}_n)\)

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