New distance concept and graph theory approach for certain coding techniques design and analysis

DOI10.1515/CAIM-2019-0012MaRDI QIDQ2325893zbMATH OpenOpenAlexFDO

Authors Khmaies Ouahada, Hendrik C. Ferreira

Publication date 1 October 2019

Published in Communications in Applied and Industrial Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1515/caim-2019-0012

zbMATH Keywords

cube graphdistance mappingsgraph theoryindex permutation graphspectral codes

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Linear codes (general theory) (94B05) Convolutional codes (94B10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• The minimum distance of graph codes
• scientific article; zbMATH DE number 3985112
• Graph theoretic aspects of minimum distance and equivalence of binary linear codes
• Grassmannian Codes With New Distance Measures for Network Coding
• Graph theoretic methods in coding theory
• Graph distance‐dependent labeling related to code assignment in computer networks
• scientific article; zbMATH DE number 3298614
• scientific article; zbMATH DE number 1189027
• New distance-based graph invariants and relations among them
• On the minimum distance graph of an extended Preparata code

Cites work

• A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings
• scientific article; zbMATH DE number 3781076 (Why is no real title available?)
• scientific article; zbMATH DE number 3446921 (Why is no real title available?)
• List Decoding of Insertions and Deletions

This page was built for publication: New distance concept and graph theory approach for certain coding techniques design and analysis

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