Computer Science – Information Theory
Scientific paper
2012-04-20
ISIT 2012 - Internation Symposium on Information Theory (2012)
Computer Science
Information Theory
Scientific paper
A new approach to bound the minimum distance of $q$-ary cyclic codes is
presented. The connection to the BCH and the Hartmann--Tzeng bound is
formulated and it is shown that for several cases an improvement is achieved.
We associate a second cyclic code to the original one and bound its minimum
distance in terms of parameters of the associated code.
Bezzateev Sergey
Zeh Alexander
No associations
LandOfFree
Describing A Cyclic Code by Another Cyclic Code 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 Describing A Cyclic Code by Another Cyclic Code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Describing A Cyclic Code by Another Cyclic Code will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-5412