On the minimum distance of cyclic codes
Web1 de jan. de 2024 · Middle East Technical University Abstract Two bounds on the minimum distance of cyclic codes are proposed. The first one generalizes the Roos bound by embedding the given cyclic code into a... Web7 de dez. de 1998 · It is desired to develop a method that can derive the weight distribution with high speed, or the minimum distance and the number of corresponding code …
On the minimum distance of cyclic codes
Did you know?
Web15 de mar. de 2024 · In this paper, we provide two complementary results for cyclic codes of composite length. First, we give a general construction of cyclic codes of length nr … 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; …
WebWe give a general lower bound for the minimum distance of $q$-ary quasi-cyclic codes of length $m\ell$ and index $\ell$, where $m$ is relatively prime to $q$. Web19 de mar. de 2013 · Bounds on the Minimum Distance of Punctured Quasi-Cyclic LDPC Codes Abstract: Recent work by Divsalar has shown that properly designed protograph …
Web13 de mar. de 2014 · In coding theory estimating the minimum distance of a given code is one of the main problems, which has been studied by many researchers. Several bounds on the minimum distance are presented (such as Bose and Chaudhuri [ 1 ]; Hocquenghem [ 8 ]; Boston [ 3 ]; Hartmann and Tzeng [ 6 ]; Hartmann et al. [ 7 ]; Roos [ 9, 10 ]). WebSection 4 focuses on lower bounds for the minimum sum-rank distance of a cyclic-skew-cyclic code. We provide the analogues of the Roos bound and of the Hartmann-Tzeng bound, exploiting the notion of defining sets for cyclic-skew-cyclic codes. In Section 5 we focus on tensor products of codes. We combine a cyclic code in the Hamming
Web10 de abr. de 2024 · The primary goal of this article is to study the structural properties of cyclic codes over a finite ring R=Fq[u1,u2]/ u12−α2,u22 −β2 ... In view of Theorem 7, …
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 … reloj binarioWebThe minimum distance of a class of reversible cyclic codes has been proved to be greater than that given by the BCH bound. economic research-ekonomska istrazivanja是几区Web7 de dez. de 1998 · It is desired to develop a method that can derive the weight distribution with high speed, or the minimum distance and the number of corresponding code words. Recently, Barg and Dumer [5] proposed a method in which the minimum distance and the number of corresponding code words are determined efficiently, by utilizing the … economist\u0027s ijWeb9 de ago. de 2024 · A cyclic code is a cyclic q-ary code of length n, constant weight w and minimum distance d.Let denote the largest possible size of a cyclic code. The pure and mixed difference method plays an important role in the determination of upper bound on .By analyzing the distribution of odd mixed and pure differences, an improved upper bound … reloj biologico plantasWebThis 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 … economic research-ekonomska istrazivanja怎么样Web8 de jun. de 2009 · The Minimum Hamming Distance of Cyclic Codes of Length 2p s. June 2009. DOI: 10.1007/978-3-642-02181-7_10. Conference: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 18th ... reloj branzi orologiWeb10 de mai. de 2011 · A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound … reloj biologico