A Characterization of Two-Weight Projective Cyclic Codes

DOI10.1109/TIT.2014.2366742MaRDI QIDQ2978804zbMATH OpenOpenAlexFDO

Authors Tao Feng

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cyclic codes (94B15)

Abstract: We give necessary conditions for a two-weight projective cyclic code to be the direct sum of two one-weight irreducible cyclic subcodes of the same dimension, following the work of Wolfmann and Vega. This confirms Vega's conjecture that all the two-weight cyclic codes of this type are the known ones in the projective case.

Cited in

(6)

• Projective two-weight irreducible cyclic and constacyclic codes
• Constructing few-weight linear codes and strongly regular graphs
• A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field
• Are<tex>$2$</tex>-Weight Projective Cyclic Codes Irreducible?
• The extended codes of projective two-weight codes
• Three-weight cyclic codes and their weight distributions

This page was built for publication: A Characterization of Two-Weight Projective Cyclic Codes

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