An elementary construction of codes from the groups of units of residue rings of polynomials

Abstract

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.

Department(s)

Mathematics

Document Type

Article

DOI

https://doi.org/10.1109/TIT.2004.839540

Keywords

Codes, Polynomials, Residue rings, Units

Publication Date

1-1-2005

Journal Title

IEEE Transactions on Information Theory

Share

COinS