Results 111 to 120 of about 1,348 (148)
Some of the next articles are maybe not open access.
A class of constacyclic BCH codes
Cryptography and Communications, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhonghua Sun 0001, Shixin Zhu, Liqi Wang
openaire +1 more source
On the duals of binary BCH codes
IEEE Transactions on Information Theory, 2001Summary: We give bounds for the minimal distance of duals of binary Bose-Chaudhuri-Hocquenghem (BCH) codes in a range where the Carlitz-Uchiyama bound is trivial. This is done by estimating the number of points on certain curves over finite fields.
openaire +1 more source
On Fuzzifying Ideals in BCH-algebras
2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery, 2009The aim of this paper is to extend fuzzifying BCHalgebra by introducing a unary predicate and by adopting the semantic method of continuous lattice valued logic. We define the concepts of fuzzifying sub algebras, fuzzifying ideals, fuzzifying closed ideals, fuzzifying q-ideals and fuzzifying implicative ideals in BCH-algebras, and discuss the relations
openaire +1 more source
2021
Tämän tutkielman tarkoituksena on tutustuttaa lukija BCH-koodeihin. BCH-koodit ovat syklisiä koodeja ja ne pystyvät korjaamaan useita virheitä. Tutkielmassa esitetään erilaisia tapoja korjata koodisanoihin tulleita virheitä käyttäen hyväksi äärellisten kuntien teoriaa ja lineaari- sekä polynomialgebraa.
openaire +1 more source
Tämän tutkielman tarkoituksena on tutustuttaa lukija BCH-koodeihin. BCH-koodit ovat syklisiä koodeja ja ne pystyvät korjaamaan useita virheitä. Tutkielmassa esitetään erilaisia tapoja korjata koodisanoihin tulleita virheitä käyttäen hyväksi äärellisten kuntien teoriaa ja lineaari- sekä polynomialgebraa.
openaire +1 more source
Nonbinary BCH decoding (Abstr.)
IEEE Transactions on Information Theory, 1968The decoding of BCH codes readily reduces to the solution of a certain key equation. An iterative algorithm is presented for solving this equation over any field. Following a heuristic derivation of the algorithm, a complete statement of the algorithm and proofs of its principal properties are given.
openaire +1 more source
The q-Ary Antiprimitive BCH Codes
IEEE Transactions on Information Theory, 2022Hongwei Zhu +2 more
exaly
On subgroup subcodes of BCH codes
J. Inf. Process. Cybern., 1991Summary: An approach to multiple errors correcting \(q\)-ary codes, viewed as subgroup subcodes of BCH codes, is presented. It has been shown that in the case of \(d\leqq q=p^ l\) for an infinite sequence of lengths the cardinality of obtained codes exceeds the cardinality of the corresponding BCH codes not less than \((q/p)^{d-2}\) times, i.e.
openaire +1 more source

