On the Hasse diagram of binary linear codes

DOI10.1142/S1793830923501148MaRDI QIDQ6983333zbMATH OpenFDO

Authors Lisbeth D. Delgado-Ordoñez, John H. Castillo, Alexander Holguín-Villa

Publication date 15 May 2025

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830923501148

zbMATH Keywords

coset leadergraphHasse diagramlinear codepartially ordered set

Mathematics Subject Classification ID

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

Cites work

• A recursive approach to low complexity codes
• Binary codes with covering radius one: Some new lower bounds
• Codes based on complete graphs
• Coloring triangle-free graphs with local list sizes
• Error-correcting codes from graphs
• Finding and counting given length cycles
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Fundamentals of Error-Correcting Codes
• Graph theoretic aspects of minimum distance and equivalence of binary linear codes
• Graph theoretic methods in coding theory
• GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 2114370 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Is code equivalence easy to decide?
• Tanner graphs for group block codes and lattices: construction and complexity
• Which codes have cycle-free Tanner graphs?
• Which Codes Have$4$-Cycle-Free Tanner Graphs?

This page was built for publication: On the Hasse diagram of binary linear codes

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