Abstract
Irreducible cyclic codes form an important family of cyclic codes and have applications in space communications. Their weight distributions measure their error performance relative to several channels, and hence have been an interesting object of study for a long time. In this note, we provide a method to determine the weight distributions of q-ary irreducible cyclic codes of length n, where q is a prime power and n is a positive integer coprime to q. This method is more effective for irreducible cyclic codes of some special lengths. We also list some optimal irreducible cyclic codes, which attain the distance bounds given in Grassl's Table [Code Tables: Bounds on the parameters of various types of codes, http://www.codetables.de ].
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
