You are asking two different questions:

1. What are the $2^{n_d} \binom{n_d}{m}$-many codimension $m$ neighbors of a given node?

2. Given a description of a neighbor, how to locate it?

Regarding the first question, a neighbor of codimension $m$ is given by (1) a subset $S$ of the coordinates of size $m$, (2) for each $x \in S$, a direction $d_x \in \{-1,+1\}$. The address of a neighbor is obtined by adding $d_x$ to coordinate $x$.

Regarding the second question, the simplest algorithm would consist of the following steps:

1. Find the address of the node by traversing the tree up.

2. Find the address of the neighbor. This part is described above.

3. Find the neighbor by traversing the tree down.

These steps are straightforward generalizations of the algorithm described in the link.

You are asking two different questions:

1. What are the $2^{n_d} \binom{n_d}{m}$-many codimension $m$ neighbors of a given node?

2. Given a description of a neighbor, how to locate it?

Regarding the first question, a neighbor of codimension $m$ is given by (1) a subset $S$ of the coordinates of size $m$, (2) for each $x \in S$, a direction $d_x \in \{-1,+1\}$. The address of a neighbor is obtined by adding $d_x$ to coordinate $x$.

Regarding the second question, the simplest algorithm would consist of the following steps:

1. Find the address of the node by traversing the tree up.

2. Find the address of the neighbor. This part is described above.

3. Find the neighbor by traversing the tree down.

These steps are straightforward generalizations of the algorithm described in the link.