1-Perfect Codes Over Dual-Cubes vis-à-vis Hamming Codes Over Hypercubes

DOI10.1109/TIT.2015.2448674zbMATH Open1359.94801OpenAlexW2406703928MaRDI QIDQ2977334FDOQ2977334

Authors: Pranava K. Jha 

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2015.2448674

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cited In (7)

• The diagnosability and 1-good-neighbor conditional diagnosability of hypercubes with missing links and broken-down nodes
• Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube
• Reliability evaluation of generalized exchanged hypercubes based on imprecise diagnosis strategies
• A note of independent number and domination number of \(Q_{n, k, m}\)-graph
• Hypercube 1-factorizations from extended Hamming codes
• A note on the connectivity of the exchanged hypercube
• Graphs that are simultaneously efficient open domination and efficient closed domination graphs

This page was built for publication: 1-Perfect Codes Over Dual-Cubes vis-à-vis Hamming Codes Over Hypercubes

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