The shortest k-dimension paths (k-paths) between vertices of n-cube are considered on the basis a bijective mapping of k-faces into words over a finite alphabet. The presentation of such paths is proposed as (n － k + 1)×n matrix of characters from the same alphabet. A classification of the paths is founded on numerical invariant as special partition. The partition consists of n parts, which correspond to columns of the matrix.
 Mollard, M. and Ramras, M. (2013) Edge Decompositions of Hypercubes by Paths and by Cycles.
 Mundici, D. (2012) Logic on the n-Cube. http://arxiv.org/pdf/1207.5717.pdf
 Leader, I. and Long, E. (2013) Long Geodesics in Subgraphs of the Cube.
 Erde, J. (2013) Decomposing the Cube into Paths. http://xxx.tau.ac.il/pdf/1310.6776.pdf
 Rota, G.-C. and Metropolis, N. (1978) Combinatorial Structure of the Faces of the n-Cube. SIAM Journal on Applied Mathematics, 35, 689-694. http://dx.doi.org/10.1137/0135057
 Stanley, R.P. (1999) Enumerative Combinatorics. Cambridge University Press, Cambridge.
 Manin, Y.I. (1999) Classical Computing, Quantum Computing, and Shor’s Factoring Algorithm.
 Ryabov, G.G. (2009) On the Quaternary Coding of Cubic Structures. (in Russian)
 Ryabov, G.G. (2011) Hausdorff Metric on Faces of the n-Cube. Journal of Mathematical Sciences, 177, 619-622.