Download citation
Download citation
link to html
The HK representation of close-packed polytypes is studied as a binary code. It is shown that the HK code can be seen as operators forming a group. The neutrality condition is then translated to HK sequences that result in the identity operator. The symmetry of an HK word can be related to the space-group symmetry of the corresponding polytype. All HK code types corresponding to all possible close-packed space groups are reported. From a coding perspective, equivalent HK codes correspond to bracelet equivalent classes. An efficient algorithm with execution time constant per generated object is modified to generate all non-equivalent polytypes of a given length.

Supporting information

txt

Text file https://doi.org/10.1107/S010876730801461X/zm5042sup1.txt
The C code of the polytype generation algorithm


Follow Acta Cryst. A
Sign up for e-alerts
Follow Acta Cryst. on Twitter
Follow us on facebook
Sign up for RSS feeds