Web10 de abr. de 2010 · We show that the minimum distance of a linear code ... We also characterize the affine-invariant maximal extended cyclic codes. Then by the CSS … WebIndex Terms—Cyclic Code, Cyclic Product Code, Bound on the Minimum Distance, Efficient Decoding I. INTRODUCTION Cyclic codes play a central role in (distributed) …

On the minimum distance of cyclic codes - IEEE Xplore

WebFlag codes that are orbits of a cyclic subgroup of the general linear group acting on flags of a vector space over a finite field, are called cyclic orbit flag codes. In this paper, we present a new contribution to the study of such codes, by focusing this time on the generating flag. More precisely, we examine those ones whose generating flag has at least one subfield … WebAbstract: The minimum distance of a class of reversible cyclic codes has been proved to be greater than that given by the BCH bound. It is also noted that this class of codes … brick road brewery corsicana

On the roots and minimum rank distance of skew cyclic codes

Web30 de jun. de 2014 · And we also calculate the minimum distance of some cyclic codes and give lower bounds on the minimum distance for some other cyclic codes. Keywords: Cyclic codes, Whiteman generalized cyclotomic sequences, generator polynomial, minimum distance. Mathematics Subject Classification: Primary: 58F15, 58F17; … WebThis bound is related to a second method for bounding the minimum distance of a cyclic code, which we call shifting. This method can be even stronger than the first one. For all binary cyclic codes of length < 63 (with two exceptions), we show that our methods yield … Web6 de jun. de 2009 · A note on negacyclic and cyclic codes of length p s over a finite field of characteristic p (2009) (submitted). Google Scholar Salagean, A.: Repeated-root cyclic and negacyclic codes over a finite chain ring. brick road books ellensburg