Computer Science – Information Theory
Scientific paper
2011-08-19
Computer Science
Information Theory
Scientific paper
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.
Ding Cunsheng
Yang Jing
No associations
LandOfFree
Hamming Weights in Irreducible Cyclic Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Hamming Weights in Irreducible Cyclic Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hamming Weights in Irreducible Cyclic Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-107839