Encoding method and encoder for (n,n(n-1),n-1) permutation group code in communication modulation system

Abstract

The present disclosure provides an encoding method and an encoder for a (n, n(n−1), n−1) permutation group code in a communication modulation system, in which 2k-length binary information sequences are mapped to 2n-length permutation codeword signal points in a n-dimensional modulation constellation Γ. The constellation Γwith the coset characteristics is formed by selecting 2n-length permutation codewords from n(n−1) permutation codewords of a code set Pof the (n, n(n−1), n−1) permutation group code based on coset partition. The constellation Γis a coset code in which 2cosets are included and each coset includes 2permutation codewords, where k=k+k, and 2≤n(n−1). The present disclosure utilizes the coset characteristics to realize one-to-one correspondence mapping of the binary information sequence set to the permutation code constellation, so that the time complexity of executing the encoder is at most the linear complexity of the code length n.