On the minimum distance of cyclic codes
Web26 de jan. de 2013 · Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes Alexander Zeh, Antonia Wachter-Zeh, Maximilien … WebThe main result is a new lower bound for the minimum distance of cyclic codes that includes earlier bounds (i.e., BCH bound, HT bound, Roos bound). This 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 …
On the minimum distance of cyclic codes
Did you know?
Web3 de mar. de 2024 · arXivLabs: experimental projects with community collaborators. arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. WebThe bound involves the minimum distances of constituent codes of length ℓ as well as the minimum distances of certain cyclic codes of length m which are related to the fields …
Web14 de abr. de 2024 · PDF On Apr 14, 2024, Karima Chatouh published Skew cyclic Linear codes over 𝑹 = 𝑅 + 𝑤𝑅 + 𝑤2𝑅 ... Sum-rank BCH codes, with prescribed minimum sum-rank distance, ... WebWe deal with the minimum distances of q -ary cyclic codes of length q m - 1 generated by products of two distinct minimal polynomials, give a necessary and sufficient condition for …
Web30 de nov. de 2024 · Published: February 2024 The authors are supported by NTU Research Grant M4080456 Abstract Two bounds on the minimum distance of cyclic …
WebPure - Aanmelden
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 … can a realtor represent both parties in texasWeb10 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 … can a realtor pay a finders feeWeb13 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 ]). can a realtor lie about multiple offersWeb25 de nov. de 2024 · The codes that achieve the optimal minimum pair distance (for given codeword length, code book size and alphabet) are called Maximum Distance Separable (MDS) symbol-pair codes. A way to study the minimum pair distance of a code is through its connection to the minimum Hamming distance of the code. can a realtor represent out of stateWebSince t is small, we conclude that our algorithm will have the running time discussed above if d ^ is large. This is the case for quadratic residue codes, since a quadratic residue code is essentially self-dual, and is also the case for most BCH codes since the minimal distance of their dual can be estimated via the Carlitz-Uchiyama bound [5] and other techniques … can a realtor represent a family memberWeb26 de abr. de 2024 · We can thus conclude that the minimum distance of this code is d m i n = 6. It may be worth observing that because x + 1 is a factor of the generator, all the … fish finder surinameWeb7 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 … fish finder surf rig