1. Ádám A.: Research problem 2–10. J. Comb. Theory. 2, 393 (1967).
2. Banihashemi A.H., Blake I.F.: Trellis complexity and minimal trellis of lattices. IEEE Trans. Inf. Theory 44(5), 1829–1847 (1998).
3. Banihashemi A.H., Blake I.F.: On the trellis complexity of root lattices and their duals. IEEE Trans. Inf. Theory 45, 2168–21726 (1999).
4. Benedetto S., Garello R., Mondin M., Montorsi G.: Geometrically uniform partitions of $$L \times MPSK$$ L × M P S K constellations and related binary trellis codes. IEEE Trans. Inf. Theory 39, 1773–1798 (1993).
5. Bernstein D., Buchmann J., Dahmen E.: Post-quantum Cryptography. Springer, Berlin (2009).