A vector coding method, comprising: decomposing an initial vector to obtain a sign vector and an initial absolute vector, wherein the initial vector corresponds to a leader; coding the sign vector to obtain a sign code; performing multi-level permutation-based coding on the initial absolute vector to obtain an absolute vector code; and combining the sign code and the absolute vector code to obtain a code of the initial vector by adding the absolute vector code shifted left by the number of bits of the sign code to the sign code; wherein coding the sign vector to obtain a sign code comprises: coding signs in the sign vector which correspond to non-zero elements from the inputted vector in order, to obtain the sign code with 1 representing a positive sign and 0 representing a negative sign, or 0 representing a positive sign and 1 representing a negative sign for each non-zero element; wherein performing multi-level permutation-based coding on the initial absolute vector comprises: (a) removing from the initial absolute vector any element according to a decomposition order wherein the decomposition order is configured to remove the most frequent element from the initial absolute vector, or remove the smallest element if two or more most frequent elements exist from the initial absolute vector, thereby constructing a new absolute vector with elements not removed, wherein the decomposition order is determined by the leader; (b) performing permutation coding on positions of the elements not removed in the initial absolute vector to obtain a position code; (c) proceeding with the multi-level permutation-based coding by repeating steps (a) and (b) on the new absolute vector if the number of elements in the new absolute vector is larger than 1, till the number of the elements in the new absolute vector is one; and (d) obtaining the absolute vector code by combining all the position codes obtained in the multi-level permutation-based coding if the number of the elements in the new absolute vector is 1. decomposing an initial vector to obtain a sign vector and an initial absolute vector, wherein the initial vector corresponds to a leader; coding the sign vector to obtain a sign code; performing multi-level permutation-based coding on the initial absolute vector to obtain an absolute vector code; and combining the sign code and the absolute vector code to obtain a code of the initial vector by adding the absolute vector code shifted left by the number of bits of the sign code to the sign code; wherein coding the sign vector to obtain a sign code comprises: coding signs in the sign vector which correspond to non-zero elements from the inputted vector in order, to obtain the sign code with 1 representing a positive sign and 0 representing a negative sign, or 0 representing a positive sign and 1 representing a negative sign for each non-zero element; wherein performing multi-level permutation-based coding on the initial absolute vector comprises: (a) removing from the initial absolute vector any element according to a decomposition order wherein the decomposition order is configured to remove the most frequent element from the initial absolute vector, or remove the smallest element if two or more most frequent elements exist from the initial absolute vector, thereby constructing a new absolute vector with elements not removed, wherein the decomposition order is determined by the leader; (b) performing permutation coding on positions of the elements not removed in the initial absolute vector to obtain a position code; (c) proceeding with the multi-level permutation-based coding by repeating steps (a) and (b) on the new absolute vector if the number of elements in the new absolute vector is larger than 1, till the number of the elements in the new absolute vector is one; and (d) obtaining the absolute vector code by combining all the position codes obtained in the multi-level permutation-based coding if the number of the elements in the new absolute vector is 1. (a) removing from the initial absolute vector any element according to a decomposition order wherein the decomposition order is configured to remove the most frequent element from the initial absolute vector, or remove the smallest element if two or more most frequent elements exist from the initial absolute vector, thereby constructing a new absolute vector with elements not removed, wherein the decomposition order is determined by the leader; (b) performing permutation coding on positions of the elements not removed in the initial absolute vector to obtain a position code; (c) proceeding with the multi-level permutation-based coding by repeating steps (a) and (b) on the new absolute vector if the number of elements in the new absolute vector is larger than 1, till the number of the elements in the new absolute vector is one; and (d) obtaining the absolute vector code by combining all the position codes obtained in the multi-level permutation-based coding if the number of the elements in the new absolute vector is 1.