The invention discloses a distributed ordering method. The distributed ordering method comprises the following steps: S1.1, extending a father node to obtain two child nodes, wherein the child node with a larger path metric value is called as an FC node, and the child node with a smaller path metric value is called as an NC node; S1.2, using L FC nodes and L NC nodes which are obtained from the step S1.1, wherein path metric values of the L FC nodes form a plurality of groups of PMFC, and path metric values of the L NC nodes form a plurality of groups of PMNC; S1.3, finding out the minimum number from the groups of PMFC, recording the minimum number as PML, finding out the maximum number from the groups of PMNC, and recording the maximum number as PM1; S1.4, if PML is greater than PM1, determining that the optimal candidate node as all nodes in the groups of PMFC, and if PML is not greater than PM1, exchanging the number corresponding to the PML and the number corresponding to the PM1, and then returning to the step S1.3. The invention further discloses a method for forming CRC auxiliary polarisation codes to eliminate a list encoder continuously by using the distributed ordering method. Computation complexity can be reduced from a value as shown in the specification to a value as shown in the specification, and system delay is reduced from kL2 to kL.