The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in Jitman and Ling (Des Codes Cryptogr 74:511–531, 2015), extending the analogous Chinese remainder quasi-cyclic (Ling Solé IEEE Trans Inf Theory 47:2751–2760, 2001). We give concatenated show, as case, that two decompositions are equivalent. allows us to general minimum distance bound for constr...