Hamming Weights in Irreducible Cyclic Codes
Information Theory
2011-08-22 v1 math.IT
Abstract
Irreducible cyclic codes are an interesting type of codes and have applications in space communications. They have been studied for decades and a lot of progress has been made. The objectives of this paper are to survey and extend earlier results on the weight distributions of irreducible cyclic codes, present a divisibility theorem and develop bounds on the weights in irreducible cyclic codes.
Cite
@article{arxiv.1108.3887,
title = {Hamming Weights in Irreducible Cyclic Codes},
author = {Cunsheng Ding and Jing Yang},
journal= {arXiv preprint arXiv:1108.3887},
year = {2011}
}