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

DOI10.1109/TIT.2015.2448674zbMath1359.94801OpenAlexW2406703928MaRDI QIDQ2977334

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)

Related Items (5)

Reliability Evaluation of Generalized Exchanged Hypercubes Based on Imprecise Diagnosis Strategies ⋮ A Note of Independent Number and Domination Number of Qn,k,m-Graph ⋮ Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube ⋮ The diagnosability and 1-good-neighbor conditional diagnosability of hypercubes with missing links and broken-down nodes ⋮ 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