Title :
Automated Theorem Proving for Hexagonal Run Length Constrained Capacity Computation
Author :
Kukorelly, Zsolt ; Zeger, Kenneth
Abstract :
An automated theorem proving technique is developed and is used to show that the capacity of the hexagonal (d, k) constraint is zero whenever k = d + 3 for d = 3,4, 5,7,9,11
Keywords :
codes; theorem proving; automated theorem proving; hexagonal run length constrained capacity computation; Computer aided software engineering; Constraint theory; Helium; Labeling; Lattices; USA Councils;
Conference_Titel :
Information Theory, 2006 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
1-4244-0505-X
Electronic_ISBN :
1-4244-0504-1
DOI :
10.1109/ISIT.2006.261995
