Connections between hypercubes, DNF and Hamming distance
Connections between hypercubes, DNF and Hamming distance
Author(s): Nikolay Yankov, Velin Spasov, Genadi StrahilovSubject(s): Economy, Library and Information Science, Other, ICT Information and Communications Technologies
Published by: Шуменски университет »Епископ Константин Преславски«
Keywords: distance; DNF; graphs; hypercube; minimization
Summary/Abstract: We propose some advanced concepts from discrete math and coding theory for amplifying students' understanding of the matter. In this paper, we use the bijection between the points of the hypercube, and the minterms of the disjunctive normal form of a binary function. This allows us to introduce the concepts of: binary n- tuples, Hamming distance, paths in graphs, and graph coloring, among others.
Journal: Научни трудове. Колеж - Добрич
- Issue Year: XIV/2022
- Issue No: 1
- Page Range: 113-120
- Page Count: 8
- Language: English