WebApr 1, 2024 · Kai and Zhu [29] later proposed a method for generating quantum codes using cyclic codes of odd length over the finite chain ring F 4 + v F 4 with u 2 = 0. Further, Qian [18] has introduced a method for generating quantum error-correcting codes using cyclic codes over the finite non-chain ring F 2 + v F 2 with arbitrary length v 2 = v. WebFukshansky, Lenny and David Kogan. “Cyclic and Well-Rounded Lattices.” Moscow Journal of Combinatorics and Number Theory, vol. 11, no. 1, 2024, pp. 79-96.. Abstract: We focus …
A class of minimal cyclic codes over finite fields
WebA Sequence Construction of Cyclic Codes over Finite Fields 3 2.1 Some notation and symbols fixed throughout this paper Throughout this paper, we adopt the following … WebRecently, A. Zeh, A. Wachter-Zeh, M. Gadouleau and S. Bezzateev gave a method to obtain new lower bounds on the minimum distance of cyclic codes over finite fields. Here we … great plains checks didn\u0027t print
On the error-correcting pair for MDS linear codes with even minimum …
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 … Weblocal ring;cyclic codes;repeated-root codes;the number of codewords. 2010 MR Subject Classification:94B05;94B15. Document code:AArticle ID:0255-7797(2016)05 … WebMar 2, 2016 · In this work, we construct cyclic polar codes based on a mixed-radix Cooley-Tukey decomposition of the Galois field Fourier transform. The programs developed for … great plains check printing