An elementary construction of codes from the groups of units of residue rings of polynomials
In this note, we present an elementary verification of the minimum distance of some codes constructed by Xing. We show that the codes obtained from this construction are subsets of cosets of linear codes with a given parity-check matrix.
Codes, Polynomials, Residue rings, Units
Reid, Les, and Cameron Wickham. "An elementary construction of codes from the groups of units of residue rings of polynomials." IEEE transactions on information theory 51, no. 1 (2005): 419-420.
IEEE Transactions on Information Theory