Constacyclic codes over finite fields

From MaRDI portal
Publication:690432

DOI10.1016/J.FFA.2012.10.001zbMATH Open1272.94089arXiv1301.0369OpenAlexW2099693138MaRDI QIDQ690432FDOQ690432


Authors: Bocong Chen, Yun Fan, Liren Lin, Hongwei Liu Edit this on Wikidata


Publication date: 27 November 2012

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length elltps are characterized, where p is the characteristic of the finite field and ell is a prime different from p.


Full work available at URL: https://arxiv.org/abs/1301.0369




Recommendations




Cites Work


Cited In (75)

Uses Software





This page was built for publication: Constacyclic codes over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690432)