Editing Hypercube (section)

== References ==
* {{cite journal|author-link=Jonathan Bowen |last=Bowen |first=J. P. | title=Hypercube | journal=[[Practical Computing]] | volume=5 | issue=4 | pages=97–99 | date=April 1982 |url=http://www.jpbowen.com/publications/ndcubes.html |archive-url=https://web.archive.org/web/20080630081518/http://www.jpbowen.com/publications/ndcubes.html |url-status=dead |archive-date=2008-06-30 | access-date=June 30, 2008 }}
* {{cite book
|author-link = Harold Scott MacDonald Coxeter
|last = Coxeter
|first = H. S. M.
|title = [[Regular Polytopes (book)|Regular Polytopes]]
|edition = 3rd
|publisher = [[Dover Publications|Dover]]
|year = 1973
|pages = [https://archive.org/details/regularpolytopes0000coxe/page/122 122-123]
|chapter= §7.2. see illustration Fig. 7-2c
|isbn = 0-486-61480-8
}} p.&nbsp;296, Table I (iii): Regular Polytopes, three regular polytopes in ''n'' dimensions (''n''&nbsp;≥&nbsp;5)
* {{cite book
|first = Frederick J.
|last = Hill
|author2 = Gerald R. Peterson
|title = Introduction to Switching Theory and Logical Design: Second Edition
|year = 1974
|publisher = [[John Wiley & Sons]]
|place = New York
|isbn = 0-471-39882-9
}} Cf Chapter 7.1 "Cubical Representation of Boolean Functions" wherein the notion of "hypercube" is introduced as a means of demonstrating a distance-1 code ([[Gray code]]) as the vertices of a hypercube, and then the hypercube with its vertices so labelled is squashed into two dimensions to form either a [[Veitch diagram]] or [[Karnaugh map]].